Research on Association Rules Apriori Algorithm Improvement
Yuyi Wang
Abstract
Yuyi Wang
Abstract
To address the defects resultsed from repeatedly scanning the database and producing a large number of candidate itemsets for Apriori algorithm,We propose an improved algorithm.The algorithm only needs to scan database once,and the affairs are transformed into a binary and stored in the database,thus the storage space is saved and the speed is accelerated.Experimental results show that the efficiency of the improved algorithm for mining association rules has improved greatly.
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.
To address the defects resultsed from repeatedly scanning the database and producing a large number of candidate itemsets for Apriori algorithm,We propose an improved algorithm.The algorithm only needs to scan database once,and the affairs are transformed into a binary and stored in the database,thus the storage space is saved and the speed is accelerated.Experimental results show that the efficiency of the improved algorithm for mining association rules has improved greatly.
Key concepts: Apriori algorithm, Association rule learning, GSP Algorithm, Data mining, A priori and a posteriori, Computer science, Algorithm, Association (psychology)