论文信息 - Parallel Buddy Prima - A Hybrid Parallel Frequent itemset mining algorithm for very large databases - 字舞流文

Parallel Buddy Prima - A Hybrid Parallel Frequent itemset mining algorithm for very large databases

An aqueous ink composition for general use and for ink-jet printing which comprises, as its main components at least one dye selected from the group consisting of a cyan azo dye, a megenta azo dye and a yellow azo dye and a humectant.

S. Sumathi | S. N. Sivanandam | T. Hamsapriya | K. Nandan Babu

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

[2] Hannu Toivonen,et al. Discovery of frequent patterns in large data collections , 1996 .

[3] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[4] Heikki Mannila,et al. Finding interesting rules from large sets of discovered association rules , 1994, CIKM '94.

[5] Rakesh Agrawal,et al. Parallel Mining of Association Rules: Design, Implementation and Experience , 1999 .

[6] Ramakrishnan Srikant,et al. Mining generalized association rules , 1995, Future Gener. Comput. Syst..

[7] Jiawei Han,et al. Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

[8] Johannes Gehrke,et al. MAFIA: a maximal frequent itemset algorithm for transactional databases , 2001, Proceedings 17th International Conference on Data Engineering.

[9] Zvi M. Kedem,et al. Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set , 1998, EDBT.