基于递推式右路径扩展的XML频繁模式树挖掘

在分析现有的频繁模式树挖掘的经典算法FREQT和FreqtTree基础上,提出一种新的基于递推式右路径扩展的XML频繁模式树挖掘算法。该算法采用最右路径扩展的思想,利用递推式的候选节点集更新技术来压缩候选节点集,产生数量较少的候选模式,并且在计算候选模式树的支持数时,采用增量式技术,提高算法效率。从理论上证明该算法的正确性,并对通过具体实验验证算法的高效性。

XML Frequent Pattern Tree Mining Based on Recursive Right Path Extending

Proposes a novel XML frequent pattern tree mining based on recursive right path extending algorithm by the analysis of the FREQT and FreqtTree algorithm,which are the frequent subtree mining algorithm.The algorithm adopts the technology of the rightmost expansion.Then it uses a method of recursive updating the set of candidate nodes to reduce the number of candidate nodes.Thus,the number of the candidate patterns is small.And,it adopts incremental method to compute the support of candidate pattern trees,which improves the efficiency of algorithm.The correctness of the algorithm is proved in theory,and through specific experiment shows that the algorithm is efficient.