基于离散区间的频繁嵌入式子树挖掘算法  

Frequent embedded subtree mining algorithm based on discrete interval

作　　者：孔鹏程[1] 张继福[1] 

机构地区：[1]太原科技大学计算机科学与技术学院,太原030024

出　　处：《计算机应用》2009年第4期1120-1123,共4页journal of Computer Applications

基　　金：山西省自然科学基金资助项目(2006011041)

摘　　要：针对频繁嵌入式子树挖掘,利用离散区间来构造投影库,给出一种基于离散区间的频繁嵌入式子树挖掘算法。该算法通过离散区间消除冗余投影,有效地压缩投影库的规模,提高了子树节点计数效率,减低了算法的时空复杂性。实验结果表明该算法具有较高的挖掘效率。A frequent embedded subtree mining algorithm based on discrete interval, called DIFTM algorithm, was presented by using discrete interval to construct project database. The algorithm eliminates effectively redundant projection in the process of constructing project database by computing discrete interval so that the size of the project database was reduced, searching and counting efficiency of the subtree nodes was improved, and its time-space complexity was reduced. The experimental results show that the DIFI？M algorithm is efficient and effective.

关 键 词：数据挖掘 频繁嵌入式子树 离散区间 投影库 冗余投影 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]