| 极大频繁子树挖掘及其应用 |
| |
| 引用本文： | 杨沛,谭琦.极大频繁子树挖掘及其应用[J].计算机科学,2008,35(2):150-153. |
| |
| 作者姓名： | 杨沛 谭琦 |
| |
| 作者单位： | 1. 华南理工大学计算机应用研究所,广州,510640
2. 华南师范大学计算机学院,广州,510631 |
| |
| 摘 要： | 极大频繁子树挖掘在Web挖掘、HTML/XML文档分析、生物医学信息处理等领域有着重要的应用,可用于解决这些领域的自同构问题.本文提出了一种极大频繁子树挖掘算法(MFTM).MFTM基于最右路径扩展技术,在搜索过程中,采用覆盖定理进行裁剪,压缩搜索空间,从而极大地加快了算法的收敛速度.性能实验表明,极大频繁挖掘等算法是有效和可伸缩的.
|
| 关 键 词： | 频繁子树挖掘 Web挖掘 信息抽取 |
Maximum Frequent Tree Mining and its Applications |
| |
| YANG Pei,TAN Qi.Maximum Frequent Tree Mining and its Applications[J].Computer Science,2008,35(2):150-153. |
| |
| Authors: | YANG Pei TAN Qi |
| |
| Abstract: | A novel algorithm called Maximum Frequent Tree Mining(MFTM)is presented to discover maximum frequent sub-trees from forest.MFTM uses the right-most path expansion technique.The Overlay Theorem is proposed to reduce the search space and accelerate the convergence speed.We conduct detailed experiments to test the performance and scalability of the methods.The experiments demonstrate that MFTM is effective and scalable.MFTM can be applied to solve the isomorphic problems in the domains such as Web mining,HTML/XML data analysis,bioinformatics,and so on. |
| |
| Keywords: | Frequent tree mining Web mining Data extraction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
