Further pruning for efficient association rule discovery

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2256, Issue , 2001, Pages 605-618

  Zhang, Songmao ^a   Webb, Geoffrey I ^a  

^a DEAKIN UNIVERSITY   (Australia)

Author keywords

Machine learning; Search

Indexed keywords

ASSOCIATION RULES; LEARNING ALGORITHMS; LEARNING SYSTEMS;

APRIORI ALGORITHMS; ASSOCIATION RULE DISCOVERY; DENSE DATUM; FREQUENT ITEMSET; ITEM SETS; SEARCH; SEARCH SPACES; SEARCH TIME;

ARTIFICIAL INTELLIGENCE;

EID: 78651589012     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45656-2_52     Document Type: Conference Paper

References (17)

1. R. Agarwal, C. C. Aggarwal, and V. V. V. Prasad. Depth first generation of long patterns. In Proc. Sixth ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD2000), pages 108-118, Boston, MA, August 2000. ACM.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining associations between sets of items in massive databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pages 207-216, 1993.
3. S. D. Bay. The UCI KDD archive. [http://kdd.ics.uci.edu] Irvine, CA: University of California, Department of Information and Computer Science., 2001.
4. R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. 1998 ACMSIGMOD Int. Conf. Management of Data, pages 85-93, 1998.
5. R. J. Bayardo, R. Agrawal, and D. Gunopulos. Constraint-based rule mining in large, dense databases. Data Mining and Knowledge Discovery, 4(2/3):217-240, 2000.
6. C. Blake and C. J. Merz. UCI repository of machine learning databases. [Machinereadable data repository]. University of California, Department of Information and Computer Science, Irvine, CA., 2001.
7. C. Borgelt. apriori. (Computer Software) http://fuzzy.cs.Uni-Magdeburg.de/borgelt/, February 2000.
8. S. H. Clearwater and F. J. Provost. RL4: A tool for knowledge-based induction. In Proc. Second Intl. IEEE Conf. on Tools for AI, pages 24-30, Los Alamitos, CA, 1990. IEEE Computer Society Press.
9. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD’00), Dallas, TX, May 2000.
10. S. Morishita and A. Nakaya. Parallel branch-and-bound graph search for correlated association rules. In Proc. ACM SIGKDD Workshop on Large-Scale Parallel KDD Systems, volume LNAI 1759, pages 127-144. Springer, Berlin, 2000.
11. J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. 2000 ACM-SIGMOD Int. Workshop on Data Mining and Knowledge Discovery (DMKD’00), Dallas, TX, May 2000.
12. F. Provost, J. Aronis, and B. Buchanan. Rule-space search for knowledge-based discovery. CIIO Working Paper IS 99-012, Stern School of Business, New York University, New York, NY 10012, 1999.
13. R. Rymon. Search through systematic set enumeration. In Proc. KR-92, pages 268-275, Cambridge, MA, 1992.
14. R. Segal and O. Etzioni. Learning decision lists using homogeneous rules. In AAAI- 94, Seattle, WA, 1994. AAAI press.
15. G. I. Webb. OPUS: An efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research, 3:431-465, 1995.
16. G. I. Webb. Efficient search for association rules. In The Sixth ACM SIGKDD Int. Conf.Knowledge Discovery and Data Mining, pages 99-107, Boston, MA, 2000. The Association for Computing Machinery.
17. M. J. Zaki. Generating non-redundant association rules. In Proceedingsof the Sixth ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD2000), pages 34-43, Boston, MA, August 2000. ACM.