【摘要】 提出用模式增长方法在带标记有序树构成的森林中挖掘嵌入式频繁子树.算法利用最右路径扩展方法构造完整的模式增长空间,然后根据待增长模式的拓扑结构确定其增长点并构造相应投影库,从而将挖掘频繁子树问题转化为在各投影库中寻找频繁节点问题.这大大降低算法的复杂性.实验表明其具有较高的时空效率.更多还原

【Abstract】 In this paper,an efficient pattern growth algorithm for mining frequent embedded sub-trees in rooted,labeled,and ordered trees is presented.It uses rightmost path expansion schema to construct complete pattern growth space,and creats a projection database for every grow point of the tree-pattern.So the problem is transformed from mining frequent trees to finding frequent nodes in the projected database.Thus the complexity of the algorithm is considerably reduced. Experimental results show that it is efficient for both time and space.更多还原