Domain and data partitioning for parallel mining of frequent closed itemsets

Proceedings of the Annual Southeast Conference

Volumn 1, Issue , 2005, Pages 1250-1255

  Tang, Peiyi ^a   Ning, Li ^a   Wu, Ningning ^a  

^a UNIVERSITY OF ARKANSAS AT LITTLE ROCK   (United States)

Author keywords

Association rule; Conditional database; Frequent closed itemset; Parallel algorithm; Parallel data mining; Partitioning

Indexed keywords

CONDITIONAL DATABASE; DATA PARTITIONING; DATABASE PARTITIONING; FREQUENT CLOSED ITEMSETS; INTER PROCESSOR COMMUNICATION; LARGE DATABASE; LOAD BALANCE; PARALLEL DATA MINING; PARALLEL PROCESSOR; POWER SET; SEARCH SPACES; SUB-LATTICES;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING; DATA MINING; MACHINERY; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

DATABASE SYSTEMS;

EID: 34248367568     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1167350.1167423     Document Type: Conference Paper

References (13)

1. R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the A CM SIGMOD International Conference on Management of Database, pages 207-216, 1993.
2. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th Internatioanl Conference on Very Large Data Bases, pages 487-499, 1994.
3. Hannu Toivonen. Sampling large databases for association rules. In In Proceedings of 1996 International Confeference on Very Large Data Bases, pages 134-145, September 1996.
4. Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li. New algorithms for fast discovery of association rules. In Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pages 283-286, 1997.
5. Jr. Reberto J. Bayardo. Efficiently mining long patterns from databases. In Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pages 85-93, 1998.
6. Mohammed J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3):372-390, 2000.
7. Karam Gouda and Mohammed J. Zaki. Efficiently mining maximal frequent itemsets. In Proceedings of the First IEEE International Conference on Data Mining, pages 163-170, 2001.
8. R. Agrawal and J. C. Shafer. Parallel mining of association rules. IEEE Transactions On Knowledge And Data Engineering, 8:962-969, 1996.
9. Mohammed Javeed Zaki, Srinivasan Parthasarathy, and Wei Li. A localized algorithm for parallel association mining. In Proceedings of the 1991 ACM Symposium on Parallel Algorithms and Architectures, pages 321-330, 1997.
10. Dejiang Jin and Sotirios G. Ziavras. A super-programming approach for mining association rules in parallel on pc clusters. IEEE Transactions on Parallel and Distributed Systems, 15:783-794, 2004.
11. Nicolas Pasquier, Yves Bastide, Rafik, Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In Proceeding of the 7th International Conference on Database Theory, pages 398-416, 1999.
12. M. J. Zaki, M. Ogihara, S. Parthasarathy, and W. Li. Parallel data mining for association rules on shared-memory multiprocessors. In Proceedings of the 1996 ACM/IEEE conference on Supercomputing. Article No. 43, 1996.
13. Jian Pei, Jiawei Han, and Runying Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In Proceedings of A CM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 21-30, 2000.