论文信息 - Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization

Detailed Description of an Algorithm for Enumeration of Maximal Frequent Sets with Irredundant Dualization

We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The algorithm of Gunopulos et al. solves many dualization problems, and takes long computation time. We interleaves dualization with the main algorithm, and reduce the computation time for dualization by as long as one dualization. This also reduces the space complexity. Moreover, we accelerate the computation by using sparseness.

Takeaki Uno | Ken Satoh | K. Satoh | T. Uno

[1] Dimitrios Gunopulos,et al. Data mining, hypergraph transversals, and machine learning (extended abstract) , 1997, PODS.

[2] Takeaki Uno,et al. Enumerating Maximal Frequent Sets Using Irredundant Dualization , 2003, Discovery Science.

[3] Elias C. Stavropoulos,et al. Evaluation of an Algorithm for the Transversal Hypergraph Problem , 1999, WAE.

[4] H. Mannila,et al. Discovering all most specific sentences , 2003, TODS.

[5] Heikki Mannila,et al. On an algorithm for finding all interesting sentences , 1996 .

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

[7] Jian Pei,et al. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[8] Carla E. Brodley,et al. KDD-Cup 2000 organizers' report: peeling the onion , 2000, SKDD.

[9] Takeaki Uno. A Practical Fast Algorithm for Enumerating Minimal SetCoverings , 2002 .

[10] Ron Kohavi,et al. Real world performance of association rule algorithms , 2001, KDD '01.

[11] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.

[12] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[13] Leonid Khachiyan,et al. On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.