Effect of data skewness in parallel mining of association rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1394, Issue , 1998, Pages 48-60

  Cheung, David W ^a   Xiao, Yongqiao ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Association rules; Data mining; Data skewness; Parallel computing

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; DATA MINING; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS;

APRIORI ALGORITHMS; CANDIDATE PRUNING; COMMUNICATION SCHEMES; DATA SKEWNESS; MINING ASSOCIATIONS; NON-UNIFORMITIES; PERFORMANCE STUDY; PRUNING TECHNIQUES;

HIGHER ORDER STATISTICS;

EID: 84958976005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-64383-4_5     Document Type: Conference Paper

References (16)

1. R. Agrawal. T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of 1993 ACM-SIGMOD Int, Conf. On Management of Data, Washington, D.C., 1993.
2. R. Agrawal and R. Srikant. Feist algorithms for mining association rules. In Proc. of the 20th VLDB Conference, Santiago, Chile, 1994.
3. R. Agrawal and J.C. Shafer. Parallel mining of association rules: Design, implementation and experience. Special Issue in Data Mining, IEEE Trans. on Knowledge and Data Engineering, IEEE Computer Society, V8, N6, December 1996, pp. 962-969.
4. S. Brin, R. Motwani, J. Ullman, S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of 1991 ACM-SIGMOD Int. Conf. On Management of Data, pages 255-264, Tucson, Arizona, 1997.
5. T. M. Cover, T. A. Thomas. Elements of information theory. John Wiley & Sons, Inc., 1991.
6. D. W. Cheung, J. Han, V. Ng and C. Y. Wong. Maintenance of discovered association rules in large databases: An incremental updating technique. In Proc. of the 12th Int. Conf. on Data Eng., New Orleans, Louisiana, 1996.
7. D. W. Cheung, J. Han, V. T. Ng, A. W. Fu, Y. Fu. A fast distributed algorithm for mining association rules. In Proc. of 4th Int. Conf. on Parallel and Distributed Information Systems, pages 31-43, Miami Beach, Florida, December, 1996.
8. E. Han, G. Karypis and V. Kumar. Scalable parallel data mining for association rules. In Proc. of 1997 ACM-SIGMOD Int. Conf. On Management of Data, pages 277-288, Tucson, Arizona, 1997.
9. J Han and Y Fu. Discovery of multiple-level association rules from large databases. In Proc. of the 21th VLDB Conference, Zurich, Switzerland, 1995.
10. Message Passing Interface Forum. MPI: A Message-Passing Interface Standard, May 1994.
11. J. S. Park, M. S. Chen, and P. S. Yu. An effective hash-based algorithm for mining association rules. In Proc. of 1995 ACM-SIGMOD Int. Conf. on Management of Data, pages 175-186, San Jose, CA, May 1995.
12. J. S. Park, M. S. Chen, and P. S. Yu. Efficient parallel mining for association rules. In Proc. of the 4th Int. Conf. on Information and Knowledge Management, Baltimore, Maryland, 1995.
13. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21th VLDB Conference, Zurich, Switzerland, 1995.
14. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. 1996 ACM-SIGMOD Int. Conf. on Management of Data, Montreal, Canada, 1996.
15. T. Shintani, M. Kitsuregawa. Hash based parallel algorithms for mining association rules. In Proc. of 4th Int. Conf. on Parallel and Distributed Information Systems, Miami Beach, Florida, 1996.
16. M. J. Zaki, M. Ogihara, S. Parthasarathy, and W. Li. Parallel data mining for association rules on shared-memory multi-processors. Supercomputing’96, Pittsburg, PA, Nov 17-22, 1996.