Algorithms for association rules

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

Volumn 2600, Issue , 2003, Pages 226-234

  Hegland, Markus ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ASSOCIATION RULES; DATA MINING; LEARNING ALGORITHMS; LEARNING SYSTEMS;

APRIORI ALGORITHMS; DATA SET; DISTRIBUTED DATA; IF-THEN RULES; ITEM SETS; LARGE PARTS; SUPPORT AND CONFIDENCE;

ALGORITHMS;

EID: 33744776550     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36434-x_7     Document Type: Article

References (10)

1. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules. In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487-499. Morgan Kaufmann, 12-15 1994.
2. R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD Int'l Conf. on Management of Data, pages 85-93. ACM, 1998.
3. Bernhard Ganter and Rudolf Wille. Formal concept analysis. Springer-Verlag, Berlin, 1999. Mathematical foundations, Translated from the 1996 German original by Cornelia Franzke.
4. Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Weidong Chen, Jeffrey Naughton, and Philip A. Bernstein, editors, 2000 ACM SIGMOD Intl. Conference on Management of Data, pages 1-12. ACM Press, 05 2000.
5. Robert J. Hilderman and Howard J. Hamilton. Evaluation of interestingness measures for ranking discovered knowledge. Lecture Notes in Computer Science, 2035:247-??, 2001.
6. Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han, and Alex Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 13-24, 1998.
7. Nicolas Pasquier, Yves Bastide, Rank Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. Lecture Notes in Computer Science, 1540:398-416, 1999.
8. Ashoka Savasere, Edward Omiecinski, and Shamkant B. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st Int. Conf. on VLDB, pages 432-443, 1995.
9. Ramakrishnan Srikant and Rakesh Agrawal. Mining generalized association rules. In Proc. of the 21st Int. Conf. on VLDB, pages 407-419, 1995.
10. M. J. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In R. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani, editors, Proceedings of the Second SIAM International Conference on Data Mining. SIAM, 2002. http://www.siam.org/meetings/sdm02/proceedings/.