A Mining Algorithm for Association Rules with Negation
Yansheng Lu
Abstract
Yansheng Lu
Abstract
The research on the mining algorithms of association rules is to improve the efficiency of Apriori algorithms . The association rules with negative items are studied only by a few researchers. This article analyzes the two basic algorithms for association rules with negative items and puts forward a new algorithm based on improving the existing algorithms. The new algorithm reduces the number of the candidates which need to scan the database, and the algorithm is significant to mining the association rules with negative items.
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.
The research on the mining algorithms of association rules is to improve the efficiency of Apriori algorithms . The association rules with negative items are studied only by a few researchers. This article analyzes the two basic algorithms for association rules with negative items and puts forward a new algorithm based on improving the existing algorithms. The new algorithm reduces the number of the candidates which need to scan the database, and the algorithm is significant to mining the association rules with negative items.
Key concepts: Association rule learning, Computer science, Apriori algorithm, Negation, Data mining, Association (psychology), Efficient algorithm, Algorithm