The relation of closed itemset mining, complete pruning strategies and item ordering in Apriori-based FIM algorithms

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

Volumn 3721 LNAI, Issue , 2005, Pages 437-444

  Bodon, Ferenc ^a   Schmidt Thieme, Lars ^b  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI ALGORITHM; ITEMSET MINING; PRUNING STRATEGIES;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA ACQUISITION; DATABASE SYSTEMS; KNOWLEDGE ACQUISITION;

DATA MINING;

EID: 33646434789     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564126_43     Document Type: Conference Paper

References (9)

1. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. In: Proceedings of the 14th BDA French Conference on Advanced Databases, Hammamet, Tunisie (1998) 177-196
2. Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: Introduction to fimi03. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMP03). Volume 90 of CEUR Workshop Proceedings., Melbourne, Florida, USA (2003)
3. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In Bocca, J.B., Jarke, M., Zaniolo, C., eds.: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), Chile, Morgan Kaufmann (1994) 487-499
4. Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R., Park, M., eds.: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, California, USA, AAAI Press (1997) 283-296
5. Schmidt-Thieme, L.: Algorithmic features of eclat. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'04). Volume 126 of CEUR Workshop Proceedings., Brighton, UK (2004)
6. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on Management of data, Dallas, Texas, United States, ACM Press (2000) 1-12
7. Borgelt, C.: Efficient implementations of apriori and eclat. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03). Volume 90 of CEUR Workshop Proceedings., Melbourne, Florida, USA (2003)
8. Bodon, F.: Surprising results of trie-based fim algorithms. In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'04). Volume 126 of CEUR Workshop Proceedings., Brighton, UK (2004)
9. de la Briandais, R.: File searching using variable-length keys. In: Proceedings of the Western Joint Computer Conference. (1959) 295-298