Abstract
Frequent itemset mining is one of the most important data mining tasks. Classical frequent itemset mining algorithms need to store data in a centralized way and run in a batch way, which cannot meet the requirements of fast updating big data mining. In this paper, we propose a distributed incremental frequent itemset mining algorithm, DisCANTree, which uses CANTree to store the conditional database, achieves the load balance between nodes by grouping all items, updates the new transaction to the existing CANTree to avoid the load of tree reconstruction, and uses the efficient FPGrowth algorithm to mine CANTree to generate frequent itemsets. The popular distributed programming model MapReduce and its open source system Hadoop are used to implement the DisCANTree algorithm. The experimental results show that the DisCANTree algorithm has more advantages than the most popular PFP algorithm in performance as well as the number of transferred records between nodes, and especially suits for the fast updating sparse big data.
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.
