Abstract
Concerning the problem of low traversal efficiency when searching the FP-tree for conditional pattern bases,a new no-header-table FP-Growth algorithm was proposed.The algorithm employed a recursively backtracking way to search for conditional pattern bases,avoiding traversing the same FP-tree path multiple times.Compared with FP-Growth algorithm in terms of theoretical analysis and actual mining performance,this algorithm greatly reduced the searching cost and improved the mining efficiency of frequent patterns by 2-5 times.Finally,the algorithm was used to mine association rules in telecommunication network alarms.The high mining speed,with the coverage of 83.3% against correct rules,shows that it is superior to FP-Growth both in time and space performance.
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.
