Abstract
Mining association rules from large databases is an important problem in data mining. FP-growth is a powerful algorithm to mine frequent patterns and it is non-candidate generation algorithm using a special structure FP-tree. In order to enhance the efficiency of FP-grown algorithm, propose a novel parallel algorithm PFPTC to create sub FP-trees concurrently and a FP-tree merging algorithm called FP-merge, which can merge two FP-trees into one FP-tree. Also propose a new efficient algorithm QFP-growth, which can avoid bottleneck of FP-growth in generating a huge number of intermediate result.
Sign-in/Register to access full text options 
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.
