Abstract
Apriori and its improved algorithms can be generally classified into two kinds: SQL-based and on memory-based. In order to improve association rule mining efficiency, after analyzing the efficiency bottlenecks in some algorithms of the second class, an improved efficient algorithm is proposed. Two matrixes are introduced into the algorithm: one is used to map database and the other to store frequent 2-itemsets related information. Through the operation of two matrixes, its time complexity and space complexity decrease significantly. The experiment indicates that the method has better performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
