Abstract
Because of the weakness of traditional Apriori algorithm, this paper presents an improved algorithm for mining frequent itemsets, which constructs bit vector and graph, the algorithm deletes node and the adjacent edges according to the number of node’s edges, which need traverse graph to generate candidate itemsets and verify candidate itemset by bit vector. Experimental results show that the improved algorithm has better efficiency than Apriori algorithm.
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.
