IEEE Transactions on Knowledge and Data Engineering · 2004 · 129 citations · 9 references
ComputingComputer ScienceData MiningData StructuresData PreprocessingData Structure AlgorithmsDecision TreesFrequent Pattern MiningScalable Data MiningAssociation Rule MiningExecution Time AnalysisRule Mining
Two new structures for association rule mining (ARM), the T-tree, and the P-tree, together with associated algorithms, are described. The authors demonstrate that the structures and algorithms offer significant advantages in terms of storage and execution time.
9
Fast algorithms for mining association rules
Rakesh Agrawal, Ramakrishnan Srikant · 1998 · 10.8K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · ACM SIGMOD Record · 2000 · 6.4K citations
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · 2000 · 3.2K citations · Full text
Dynamic itemset counting and implication rules for market basket data
Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman et al. · 1997 · 2K citations
Efficiently mining long patterns from databases
Roberto J. Bayardo · 1998 · 1.3K citations