An Updating Algorithm Based on the mining result for association Rules
Xiuyu Zhang
Abstract
Xiuyu Zhang
Abstract
Apriori algorithm is a basic algorithm for all association rules,but it is Low-efficient and time-consuming that requires the scanning of the database repeatedly. It is presented in this paper with a highly efficient updating algorithm based on the latest mining result for the maintenance of discovered association rules which requires only two times scanning of the database and improves the efficiency greatly.
A significance statement is not available in the OpenAlex record.
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.
Apriori algorithm is a basic algorithm for all association rules,but it is Low-efficient and time-consuming that requires the scanning of the database repeatedly. It is presented in this paper with a highly efficient updating algorithm based on the latest mining result for the maintenance of discovered association rules which requires only two times scanning of the database and improves the efficiency greatly.
Key concepts: Association rule learning, Apriori algorithm, Computer science, Data mining, GSP Algorithm, Association (psychology), Efficient algorithm, A priori and a posteriori