ComputingComputer ScienceData MiningKnowledge RepresentationMachine LearningData WarehousingFrequent Pattern MiningAssociation Rule MiningKnowledge Discovery Processes
Association rule mining is an important model in data mining. Its mining algorithms discover all item associations (or rules) in the data that satisfy the user-specified minimum support (minsup) and minimum confidence (minconf) constraints. Minsup controls the minimum number of data cases that a rule must cover. Minconf controls the predictive strength of the rule. Since only one minsup is used for the whole database, the model implicitly assumes that all items in the data are of the same nature and/or have similar frequencies in the data. This is, however, seldom the case in reallife applications. In many applications, some items appear very frequently in the data, while others rarely appear. If minsup is set too high, those rules that involve rare items will not be found. To find rules that involve both frequent and rare items, minsup has to be set very low. This may cause combinatorial explosion because those frequent items will be associated with one another in all possible ways. T...
14
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
Dynamic itemset counting and implication rules for market basket data
Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman et al. · 1997 · 2K citations
Mining generalized association rules
Ramakrishnan Srikant, Rakesh Agrawal · Future Generation Computer Systems · 1997 · 1.6K citations