【摘要】 本文主要研究从由带标签有序树构成的森林中挖掘嵌入式频繁子树,具体做法是:首先对XML文档进行预处理,生成最简结构树SST,然后从SST中挖掘出频繁子树。本文提出了SSTMiner算法,该算法针对TreeMiner算法存在的瓶颈问题,结合当前所处理的SST的结构特点进行改进,进一步提高了算法执行的效率。实验证明,本文提出的方法能够准确高效地挖掘出XML文档中的频繁子树。更多还原

【Abstract】 This paper studies the problem of mining embedded subtrees in a forest of labeled and ordered trees.The method is that we first preprocess XML documents to get SSTs(Simplest Structural Trees) and then mine frequent trees in SSTs.In this paper,we improve TreeMiner by breaking the bottleneck of TreeMiner and present an algorithm called SSTMiner.The experiments show that this method is efficient to mine frequent trees in XML documents.更多还原