System and method for mining generalized association rules in databases

作者: Ramakrishnan Srikant , Rakesh Agrawal

DOI:

关键词:

摘要: A system and method for discovering consumer purchasing tendencies includes a computer-implemented program which identifies transaction itemsets that are stored in database appear the user-defined minimum number of times, referred to as support. The contain items characterized by hierarchical taxonomy. Then, discovers association rules, potentially across different levels taxonomy, comparing times each large appears particular subsets itemset database. When relationship exceeds predetermined confidence value, outputs generalized rule is representative consumers. set rules can be pruned uninteresting i.e., do not occur at frequency significantly than what expected based upon occurrence rule's ancestors.

参考文章(15)
Heikki Mannila, A. Inkeri Verkamo, Hannu T. T. Toivonen, Improved Methods for Finding Association Rules ,(1994)
M.A.W. Houtsma, A. Swami, Set-Oriented Mining for Association Rules IBM Research Report RJ 9567. ,(1993)
Ramakrishnan Srikant, Rakesh Agrawal, Fast algorithms for mining association rules very large data bases. pp. 580- 592 ,(1998)
Ramakrishnan Srikant, Rakesh Agrawal, Mining Generalized Association Rules very large data bases. pp. 407- 419 ,(1995)
David D. Minter, Lee V. Twyford, Buddy Stein, Michael M. Wilson, Method and system for delivering on demand, individually targeted promotions ,(1994)
M. Houtsma, A. Swami, Set-oriented mining for association rules in relational databases international conference on data engineering. pp. 25- 33 ,(1995) , 10.1109/ICDE.1995.380413
Jong Soo Park, Ming-Syan Chen, Philip S. Yu, An effective hash-based algorithm for mining association rules international conference on management of data. ,vol. 24, pp. 175- 186 ,(1995) , 10.1145/223784.223813