An improved Apriori Algorithm based on mining association rule
Xiufeng Xia
Abstract
Xiufeng Xia
Abstract
Mining association rule has been regarded as one of the most important branches in Data Mining,in which Apriori algorithm is the most classical and influential method at present.After analyzing and studying the Apriori algorithm in Mining association rule deeply,the two primary steps in Apriori algorithm,the join step and the prune step,are improved in this paper.The performance of the Apriori algorithm has been improved by scanning frequent 1-itemsets and removing the operation of generating subsets and candidate itemsets,which are used to decrease the number of the joined itemsets and to reduce the database scanning frequency respectively.
OpenAlex reports 3 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.
Mining association rule has been regarded as one of the most important branches in Data Mining,in which Apriori algorithm is the most classical and influential method at present.After analyzing and studying the Apriori algorithm in Mining association rule deeply,the two primary steps in Apriori algorithm,the join step and the prune step,are improved in this paper.The performance of the Apriori algorithm has been improved by scanning frequent 1-itemsets and removing the operation of generating subsets and candidate itemsets,which are used to decrease the number of the joined itemsets and to reduce the database scanning frequency respectively.
Key concepts: Association rule learning, Apriori algorithm, Data mining, A priori and a posteriori, GSP Algorithm, Computer science, Association (psychology), Algorithm