An Efficient Parallel Association Rules Mining Algorithm for Fault Diagnosis

Article Preview

Abstract:

With the development of Internet industry, equipment data is increasing. The traditional method is not suitable for processing large data. Aiming at inefficient problem of Apriori algorithm when mining very large database, an efficient parallel association rules mining algorithm (Advanced Pruning Parallel Apriori Algorithm) based on a cluster is presented. APPAA algorithm can enhance the mining efficiency, as well as the system’s extension. Experimental results show that APPAA algorithm cuts down 85% mining time of Apriori, and it has good characteristics of parallel and expandable.so it is suitable for mining very large size database of fault diagnosis.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1326-1330

Citation:

Online since:

May 2016

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2016 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Park J S, Chen M S, Yu P S. An Effective Hash Based Algorithm for Mining Association Rules[C]/Proceedings of ACM SIGMOD International Conference on Management of Data. New York, USA: ACM Press, (1995).

DOI: 10.1145/223784.223813

Google Scholar

[2] Han Jiawei, Pei Jian, Yin Yiwen. Mining Frequent Patterns Without Candidate Generation[C]/Proceedings of the ACM SIGMOD International Conference on Management of Data. Dallas, Texas, USA: ACM Press, (2000).

DOI: 10.1145/342009.335372

Google Scholar

[3] Pasquoer N, Bastide Y, Taouil R, et al. Discovering Frequent Closed Item Sets for Association Rules[C]/Proc. of ICDT'99. Jerusalem, Israel: [s. n. ], (1999).

DOI: 10.1007/3-540-49257-7_25

Google Scholar

[4] Berzal F, Cubero J C, Marin N. TBAR: An Efficient Method for Association Rule Mining in Relational Database[J]. IEEE Trans. on Data and Knowledge Engineering, 2001, 13(1): 47-64.

DOI: 10.1016/s0169-023x(00)00055-0

Google Scholar