| 一种挖掘XML文档频繁子树的方法 |
| |
| 引用本文： | 傅珊珊,吴扬扬.一种挖掘XML文档频繁子树的方法[J].计算机工程与科学,2007,29(10):65-67. |
| |
| 作者姓名： | 傅珊珊 吴扬扬 |
| |
| 作者单位： | 华侨大学计算机科学系,福建,泉州,362021 |
| |
| 摘 要： | 本文主要研究从由带标签有序树构成的森林中挖掘嵌入式频繁子树,具体做法是：首先对XML文档进行预处理,生成最简结构树SST,然后从SST中挖掘出频繁子树。本文提出了SSTMiner算法,该算法针对TreeMiner算法存在的瓶颈问题,结合当前所处理的SST的结构特点进行改进,进一步提高了算法执行的效率。实验证明,本文提出的方法能够准确高效地
地挖掘出XML文档中的频繁子树。
|
| 关 键 词： | XML 频繁子树 TreeMiner |
| 文章编号： | 1007-130X（2007）10-0065-03 |
| 修稿时间： | 2007-03-292007-07-09 |
A Method to Mine Frequent Trees in XML Documents |
| |
| FU Shan-shan,WU Yang-yang.A Method to Mine Frequent Trees in XML Documents[J].Computer Engineering & Science,2007,29(10):65-67. |
| |
| Authors: | FU Shan-shan WU Yang-yang |
| |
| Affiliation: | Department of Computer Science, Hnaqiao University, Qnanzhou 362021, China |
| |
| 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. |
| |
| Keywords: | XML frequent tree TreeMiner |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与科学》浏览原始摘要信息 |
|
点击此处可从《计算机工程与科学》下载全文 |
|
