Fundamenta Informaticae · 2012 · 20 citations · 22 references
ComputingComputer ScienceAlgorithmsFormal MethodsDeductive VerificationPredicate Logic
The objective of this article is to define an approach towards generating implications with (or without) negation when only a formal context K = (G, M, I) is provided. To that end, we define a two-step procedure which first (i) computes implications
22
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami · 1993 · 14.8K citations · Full text
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations
Sergey Brin, Rajeev Motwani, Craig Silverstein · 1997 · 1.3K citations
CHARM: An Efficient Algorithm for Closed Itemset Mining
Mohammed J. Zaki, Ching-Jui Hsiao · 2002 · 901 citations