Zheng Yili
Abstract
Apriori algorithm is a famous algorithm for association rules but it scans the database for several times. This paper presents a highly efficient updating algorithm based on the latest mining result for the maintenance of discovered association rules. It scans the database only two times 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 famous algorithm for association rules but it scans the database for several times. This paper presents a highly efficient updating algorithm based on the latest mining result for the maintenance of discovered association rules. It scans the database only two times and improves the efficiency greatly. ;;;
Key concepts: Association rule learning, Computer science, Apriori algorithm, Data mining, GSP Algorithm, A priori and a posteriori, Algorithm, Efficient algorithm