The Improved Apriori Algorithm Research Based on Matrix
Dan Song
Abstract
Dan Song
Abstract
For the inadequacy of Apriori algorithm in association rules,this paper presents two methods of Apriori Algorithm based on matrix.Improved algorithms make full use of the matrix to significantly reduce the number of scans the database and computing costs,and then improve the efficiency of the algorithm effectively.Meanwhile,the application example and algorithm performance analysis shows that the proposed two improved algorithms are efficient association rule mining method,and the properties are better than the Apriori algorithm.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For the inadequacy of Apriori algorithm in association rules,this paper presents two methods of Apriori Algorithm based on matrix.Improved algorithms make full use of the matrix to significantly reduce the number of scans the database and computing costs,and then improve the efficiency of the algorithm effectively.Meanwhile,the application example and algorithm performance analysis shows that the proposed two improved algorithms are efficient association rule mining method,and the properties are better than the Apriori algorithm.
Key concepts: Apriori algorithm, Computer science, Association rule learning, Data mining, A priori and a posteriori, Algorithm, GSP Algorithm, Matrix (chemical analysis)