计算机科学 ›› 2011, Vol. 38 ›› Issue (5): 138-141.
• 数据库与数据挖掘 • 上一篇 下一篇
郭鑫,董坚峰,周清平
出版日期:
发布日期:
基金资助:
GUO Xin,DONG Jian-feng,ZHOU Qing-ping
Online:
Published:
摘要: 针对动态数据库随时间发生改变的特性,提出了一种新的在动态数据库中挖掘频繁子树的算法,引入树的转变概率、子树期望支持度和子树动态支持度等概念,提出了动态数据库中的支持度计算方法和子树搜索空间,从而解决了数据动态变化的频繁子树挖掘问题。随着子树搜索的进行,算法定义裁剪公式和混合数据结构,能有效地减少子树搜索空间和提高频繁子树的同构速度。实验结果表明,新算法有效可行,且具有较好的运行效率。
关键词: 数据挖掘,有序树,频繁子树,支持度,动态数据库
Abstract: On account of dynamic database's characteristic which is changing over time,a new algorithm aiming to mine frequent subtree from dynamic database was proposed. It put forward the support algorithm and subtree-searching space involving some concepts such as tree change probability, subtree expectation support and subtree dynamic support. The problem of mining frequent subtree from dynamic database was investigated. With the process of the subtrecsearching,algorithm definition pruning expressions and mix data structure could reduce subtre}searching space and improve frequcnt subtrec isomorphism speed efficiently. The experimental result showed that the new algorithm is effective and workable and has a better operating efficiency.
Key words: Data mining, Ordered tree, Frecauent subtree, Support, Dynamic database
郭鑫,董坚峰,周清平. 动态数据库中的频繁子树挖掘算法[J]. 计算机科学, 2011, 38(5): 138-141. https://doi.org/
GUO Xin,DONG Jian-feng,ZHOU Qing-ping. Mining Frequent Subtrees from Dynamic Database[J]. Computer Science, 2011, 38(5): 138-141. https://doi.org/
0 / / 推荐
导出引用管理器 EndNote|Reference Manager|ProCite|BibTeX|RefWorks
链接本文: https://www.jsjkx.com/CN/
https://www.jsjkx.com/CN/Y2011/V38/I5/138
Cited