Research and Application of Improved Apriori Algorithm Based on Matrix

Abstract:

This article put forward a NCM_Apriori algorithm, which through compressing matrix and reducing the scan times to reduce the database I/O overhead, effectively improve the efficiency of association rule mining. At the same time in the process of generating association rules, computation is greatly reduced by using the nature of probability. And applies the algorithm to the mining of students' course selection system, which can provide decision support for colleges and universities.

• Periodical: Applied Mechanics and Materials (Volumes 668-669)
• Pages: 1102-1105
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.668-669.1102
• Online since: October 2014
• Authors: Yuan Liu*, Yuan Sheng Lou
• Keywords: Association Rule, Data Mining, NCM_Apriori Algorithm

References

[1] Agrawal R, Imieliński T, Swami A. Mining association rules between sets of items in large databases[C]/ACM SIGMOD Record. ACM, 1993, 22(2): 207-216.

DOI: 10.1145/170036.170072

[2] Pang-Ning T, Steinbach M, Kumar V. Introduction to data mining[C]/Library of Congress. (2006).

[3] Bo wu, Dufu Zhang , etc. An Efficient Frequent Patterns Mining Algorithm Based on Apriori Algorithm and the FP-Tree Structure[c]. Third International Conference on Convergence and Hybrid Information Technology, 2008, 1: 1099-1102.

DOI: 10.1109/iccit.2008.109

[4] Chen Chu xiang, Shen Jian jing, etc. An Improvement Apriori Arithmetic Based on Rough Set Theory[C]. 2011 Third Pacific-asia Conference on Circuits, Communications and System, 2011: 1-3.

DOI: 10.1109/paccs.2011.5990261

[5] Dongme Sun, Shaohua Teng, etc. An Algorithm to Improve the Effectiveness of Apriori[C]. 6th IEEE International Conference on Cognitive Informatics , 2007: 385-390.

DOI: 10.1109/coginf.2007.4341914