IEEE Transactions on Knowledge and Data Engineering · 2001 · 342 citations · 18 references
ComputingComputer ScienceData AnalyticsData MiningInformation RetrievalCollaborative FilteringFrequent Pattern MiningText MiningWeb MiningAssociation Rule MiningCausal RelationshipsClustering Of Web DocumentsFrequent Itemset MiningPattern MiningRandom SamplingRandom Sampling AlgorithmsRule Mining
Association-rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a priori algorithm is only effective when the only rules of interest are relationships that occur very frequently. However, there are a number of applications, such as data mining, identification of similar Web documents, clustering, and collaborative filtering, where the rules of interest have comparatively few instances in the data. In these cases, we must look for highly correlated items, or possibly even causal relationships between infrequent items. We develop a family of algorithms for solving this problem, employing a combination of random sampling and hashing techniques. We provide analysis of the algorithms developed and conduct experiments on real and synthetic data to obtain a comparative performance analysis.
18
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
Pattern Classification and Scene Analysis
Michael Thompson, Richard O. Duda, Peter E. Hart · Leonardo · 1974 · 4.5K citations
Piotr Indyk, Rajeev Motwani · 1998 · 4.2K citations · Full text