论文信息 - On benchmarking frequent itemset mining algorithms: from measurement to analysis - 字舞流文

On benchmarking frequent itemset mining algorithms: from measurement to analysis

We point out problems of current practices in comparing Frequent Itemset Mining Implementations, and suggest techniques that can help to avoid the conclusions of measurements being tainted by these problems.

Lars Schmidt-Thieme | Ferenc Bodon | Balázs Rácz

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

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

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

[4] Bart Goethals,et al. Survey on Frequent Pattern Mining , 2003 .

[5] David Thomas,et al. The Art in Computer Programming , 2001 .

[6] Hiroki Arimura,et al. LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets , 2004, FIMI.

[7] Donald E. Knuth,et al. The Art of Computer Programming, Volumes 1-3 Boxed Set , 1998 .

[8] Balázs Rácz,et al. nonordfp: An FP-growth variation without rebuilding the FP-tree , 2004, FIMI.

[9] Ke Wang,et al. Top Down FP-Growth for Association Rule Mining , 2002, PAKDD.

[10] Srinivasan Parthasarathy,et al. New Algorithms for Fast Discovery of Association Rules , 1997, KDD.