Abstract
Due to the continuous dynamic changes of data in the current era, research on incremental association rules is necessary. Among them, frequent pattern mining has always been the subject of research. The research found that among the existing algorithms, Can Tree is very suitable for incremental mining because of its superior nature that it does not require adjustment, merging, and/or splitting of tree nodes during maintenance. In this paper, a new method of mining Can Tree is proposed to solve the problem of time consuming caused by repeatedly traversing paths when obtaining conditional mode basis. The path only needs to be traversed once to meet the requirements and verify it. Experimental results show that the performance of the algorithm is better than the traditional Can Tree algorithm, reducing time consumption to a certain extent.
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.
