Abstract

Abstract The apriori scans database many times and generates large candidate itemsets so that its I/O performance and efficiency seriously affect the universal application and promotion. In order to solve the problem, the paper proposed a method by seting a unique number and recording the location of each itemset. It scans the database once and never generates the huge candidate itemsets and has been applied to QAR data. Experiments show that the proposed algorithm is capable of discovering meaningful and useful association rules in an effective manner, speeding up less execution time.

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 call

Disclaimer: 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.