Communication-efficient distributed mining of association rules

Data Mining and Knowledge Discovery

Volumn 8, Issue 2, 2004, Pages 171-196

  Schuster, Assaf ^a   Wolff, Ran ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Association Rules; Communication efficient; Data mining; Distributed algorithms

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; KNOWLEDGE ACQUISITION; PARAMETER ESTIMATION; PROBLEM SOLVING;

ASSOCIATION RULES; DISTRIBUTED ALGORITHMS; PEER-TO-PEER SYSTEMS;

DATA MINING;

EID: 3543095066     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DAMI.0000015870.80026.6a     Document Type: Article

References (16)

1. Agrawal, R. and Shafer, J. 1996. Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering, 8(6):962-969.
2. Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proc. of the 20th Int'l. Conference on Very Large Databases (VLDB'94). Santiago, Chile, pp. 487-499.
3. Bayardo, R. and Agrawal, R. 1999. Mining the most interesting rules. In Proc. of the ACM SIGKDD Conf. on Knowledge Discovery and Data Mining. San Diego, California, pp. 145-154.
4. Brin, S., Motwani, R., Ullman, J.D., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. SIGMOD Record, 6(2):255-264.
5. Cheung, D. and Xiao, Y. 1998. Effect of data skewness in parallel mining of association rules. In 12th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 48-60.
6. Cheung, D.W., Han, J., Ng, V., Fu, A., and Fu, Y. 1996. A fast distributed algorithm for mining association rules. In Proc. of 1996 Int'l. Conf. on Parallel and Distributed Information Systems. Miami Beach, Florida, pp. 31-44.
7. Eui-Hong (Sam) Han, Karypis, O., and Kumar, V. 2000. Scalable parallel data mining for association rules. IEEE Transactions on Knowledge and Data Engineering, 12(3):352-377.
8. Han, J., Pei, J., and Yin, Y. 1999. Mining frequent patterns without candidate generation. Technical Report 99-12, Simon Fraser University.
9. Han, J. and Fu, Y. 1995. Discovery of multiple-level association rules from large databases. In Proc. of the 21st Int'l. Conference on Very Large Data Bases (VLDB'95). Zurich, Switzerland, pp. 420-431.
10. Jarai, Z., Virmani, A., and Iftode, L. 1998. Towards a cost-effective parallel data mining approach. Workshop on High Performance Data Mining (held in conjunction with IPPS'98).
11. Park, J.S., Chen, M.-S., and Yu, P.S. 1995. An effective hash-based algorithm for mining association rules. In Proc. of ACM SIGMOD Int'l. Conference on Management of Data. San Jose, California, pp. 175-186.
12. Schuster, A. and Wolff, R. 2001. Communication-efficient distributed mining of association rules. In Proc. of the 2001 ACM SIGMOD Int'l. Conference on Management of Data. Santa Barbara, California, pp. 473-484.
13. Srikant, R. Synthetic data generation code for association and sequential patterns. Available from the I.B.M. Quest Web site at http://www.almaden.ibm. com/cs/quest/.
14. Srikant, R. and Agrawal, R. 1994. Mining generalized association rules. In Proc. of the 20th Int'l. Conference on Very Large Databases (VLDB'94). Santiago, Chile, pp. 407-419.
15. Toivonen, H. 1996. Sampling large databases for association rules, The VLDB Journal, 134-145.
16. Zaki, M.J., Ogihara, M., Parthasarathy, S., and Li, W. 1996. Parallel data mining for association rules on shared-memory multi-processors. In Proc. of Supercomputing'96. Pittsburg, PA, pp. 17-22.