论文信息 - Performance Drivers for Depth-First Frequent Pattern Mining

Performance Drivers for Depth-First Frequent Pattern Mining

Fast algorithms for mining frequent itemsets nowadays are highly optimized and specialized. Often they resemble the basic algorithms as Apriori and Eclat only faintly. But algorithms for other pattern domains as sequences etc. typically are built on top of the basic algorithms and thus cannot participate in improvements for highly specialized algorithms for itemsets.

Martin Schader | Lars Schmidt-Thieme | M. Schader | L. Schmidt-Thieme

[1] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.

[2] Mohammed J. Zaki. Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[3] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[4] Wolfgang Gaul,et al. Mining generalized association rules for sequential and path data , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[5] Fabrizio Silvestri,et al. kDCI: a Multi-Strategy Algorithm for Mining Frequent Sets , 2003, FIMI.

[6] Andrea Pietracaprina,et al. Mining Frequent Itemsets using Patricia Tries , 2003, FIMI.

[7] Christian Borgelt,et al. EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT , 2003 .

[8] Bart Goethals,et al. Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03 , 2003, FIMI.

[9] Gösta Grahne,et al. Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[10] Mohammed J. Zaki,et al. Fast vertical mining using diffsets , 2003, KDD '03.

[11] Hiroki Arimura,et al. LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets , 2003, FIMI.

[12] Hiroki Arimura,et al. An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases , 2004, Discovery Science.