A load-balanced distributed parallel mining algorithm

Expert Systems with Applications

Volumn 37, Issue 3, 2010, Pages 2459-2464

  Yu, Kun Ming ^a   Zhou, Jiayi ^a   Hong, Tzung Pei ^b   Zhou, Jia Ling ^a  

^a CHUNG HUA UNIVERSITY   (Taiwan)

^b National University   (Taiwan)

Author keywords

Association rules; Cluster computing; Data mining; Frequent patterns; Parallel and distributed processing

Indexed keywords

APRIORI; APRIORI ALGORITHMS; BALANCED WORK-LOAD; COMPUTING NODES; DIGITAL INFORMATION; EXPONENTIAL GROWTH; FREQUENT PATTERNS; IDLE TIME; ITEM SETS; ITEMSET; LOAD-BALANCED; MINIMUM SUPPORT; MINING PROCESS; PARALLEL AND DISTRIBUTED COMPUTING; PARALLEL AND DISTRIBUTED PROCESSING; PARALLEL MINING ALGORITHMS; PC CLUSTERS; SINGLE SCAN; TRANSACTION IDENTIFIER;

ASSOCIATION RULES; ASSOCIATIVE PROCESSING; CLUSTER COMPUTING; COMPUTER SCIENCE; DATA MINING; DISTRIBUTED PARAMETER NETWORKS; METADATA; MINING; PARALLEL ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 70449703303     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2009.07.074     Document Type: Article

References (16)

1. Agawal, R., Imilinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD international conference on management of data (Vol. 22(2), pp. 207-216).
2. Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In Proceedings of the 20th international conference on very large databases (pp. 487-499).
3. Agrawal R., and Shafer J.C. Parallel mining of association rules. IEEE Transactions on Knowledge and Data Engineering 8 6 (1996) 962-969
4. Apte C., and Weiss S.M. Data mining with decision trees and decision rules. Future Generation Computer Systems 13 2-3 (1997) 197-210
5. Bodon, F. (2003). A fast apriori implementation. In Proceedings of the IEEE ICDM workshop on frequent itemset mining implementations.
6. Cheung, D. W., Han, J., Ng, V. T., Fu, A. W., & Fu, Y. (1996). A fast distributed algorithm for mining association rules. In The fourth international conference on parallel and distributed information systems (pp. 31-42).
7. Cheung D.W., Lee S.D., and Xiao Y. Effect of data skewness and workload balance in parallel data mining. IEEE Transactions on Knowledge and Data Engineering 14 3 (2002) 498-514
8. Cheung D.W., Ng V.T., and Fu A.W. Efficient mining of association rules in distributed databases. IEEE Transactions on Knowledge and Data Engineering 8 6 (1996) 911-922
9. Einakian, S., & Ghanbari, M. (2006). Parallel implementation of association rules in data mining. In Proceedings of the 38th southeastern symposium on system theory (pp. 21-26).
10. Han J., Pei J., Yin Y., and Mao R. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Journal of Data Mining and Knowledge Discovery 8 1 (2004) 53-87
11. IBM Almaden. (1994). I. Quest synthetic data generation code. .
12. Parthasarathy S., Zaki M.J., Ogihara M., and Li W. Parallel data mining for association rules on shared-memory systems. Knowledge and Information Systems 3 1 (2001) 1-29
13. Wu, J., & Li, X. M. (2008). An efficient association rule mining algorithm in distributed database. In International Workshop on Knowledge Discovery and Data mining (WKDD) (pp. 108-113).
14. Ye, Y., & Chiang, C. C. (2006). A parallel apriori algorithm for frequent itemsets mining. In Proceedings of the fourth international conference on software engineering research, management and applications (pp. 87-94).
15. Zaki, M. J., Ogihara, M., Parthasarathy, S., & Li, W. (1996). Parallel data mining for association rules on shared-memory multi-processors. In Proceedings of the 1996 ACM/IEEE conference on supercomputing (CDROM).
16. Zaki M.J., Parthasarathy S., Ogihara M., and Li W. Parallel algorithms for discovery of association rules. Data Mining and Knowledge Discovery 1 4 (1997) 343-373