An Algorithm for Mining Association Rules Based on Sets Operation
Bai Chunjie, Xiaoping Wu
Abstract
Bai Chunjie, Xiaoping Wu
Abstract
The discovery of association rules is an important data-mining task for which many algorithms have been proposed. However, the efficiency of these algorithms needs to be improved to handle real-world large datasets. In this paper, we present an efficient algorithm which is based on sets operation and compares it with traditional algorithms. The improved algorithm only needs to scan the database once to reduce computation time. Experiment results indicate that the new algorithm has good efficiency.
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.
The discovery of association rules is an important data-mining task for which many algorithms have been proposed. However, the efficiency of these algorithms needs to be improved to handle real-world large datasets. In this paper, we present an efficient algorithm which is based on sets operation and compares it with traditional algorithms. The improved algorithm only needs to scan the database once to reduce computation time. Experiment results indicate that the new algorithm has good efficiency.
Key concepts: Association rule learning, Computer science, Data mining, Computation, GSP Algorithm, Task (project management), Efficient algorithm, Algorithm