Research of Data Mining Algorithm Based on Association Rules
Changxin Song, Ke Ma
Abstract
Changxin Song, Ke Ma
Abstract
Through the research on the existing data mining and association rules algorithms, for the deficiencies of the current association rule mining algorithm Apriori, this paper presents an improved Apriori association rule mining algorithm. The improved algorithm can reduce the number of generated candidate item sets and database scans through cutting of the frequent item set, thus greatly improving the efficiency of mining association rules.
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.
Through the research on the existing data mining and association rules algorithms, for the deficiencies of the current association rule mining algorithm Apriori, this paper presents an improved Apriori association rule mining algorithm. The improved algorithm can reduce the number of generated candidate item sets and database scans through cutting of the frequent item set, thus greatly improving the efficiency of mining association rules.
Key concepts: Association rule learning, Apriori algorithm, Data mining, Computer science, A priori and a posteriori, GSP Algorithm, Association (psychology), Set (abstract data type)