Abstract

Low support makes dramatic increase in the number of itemsets and brings less efficient frequent itemset mining. Correlation measures introduced to restrict the number of frequent itemsets generated in order to improve the efficiency of mining under certain conditions. An improved FP-Tree algorithm using node linked list FP-Tree is proposed. This algorithm exploits efficient pruning strategies using a between-item positive correlated differences measure with a good antimonotone. Non-positive correlated long model and invalid itemsets are filtered. The range of support threshold allowing mining is expanded. Experimental results indicate the given algorithm is efficient and feasible.

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.