Apriori_Q:Solution for Minging Association Rule
Zhang Xiaolong
Abstract
Zhang Xiaolong
Abstract
The mining of association rules is the main method of data mining.This paper presents an algorithm Apriori_Q for mining association rule,which is an improvement of the existing Apriori method by reducing the times of database visit and of pattern-match.Theoretical analysis and experimental results show that Apriori_Q outperforms Apriori in association rule mining,suggesting wider area of application.
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 mining of association rules is the main method of data mining.This paper presents an algorithm Apriori_Q for mining association rule,which is an improvement of the existing Apriori method by reducing the times of database visit and of pattern-match.Theoretical analysis and experimental results show that Apriori_Q outperforms Apriori in association rule mining,suggesting wider area of application.
Key concepts: Association rule learning, Apriori algorithm, A priori and a posteriori, Data mining, Computer science, Association (psychology), Philosophy, Epistemology