Abstract
Mining association rules is an essential task for knowledge discovery. But discovering association rules based on graph need many times to traverse graph in generating candidate itemset. This paper proposes the improved algorithm, which constructs the directed graph and generate candidate item sets by using the directed neighbor nodes set, the algorithm need traverse the directed graph only once. The algorithm verifies whether a candidate itemset is a frequent itemset by logic AND operation. Experimental result shows that the improved algorithm has better efficiency than other algorithms based on graph.
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.
