首页 | 本学科首页   官方微博 | 高级检索  
     

利用编码的频繁导出式子树挖掘算法
引用本文:尹四清,孔鹏程,张素兰. 利用编码的频繁导出式子树挖掘算法[J]. 计算机工程与应用, 2011, 47(24): 121-124. DOI: 10.3778/j.issn.1002-8331.2011.24.034
作者姓名:尹四清  孔鹏程  张素兰
作者单位:1.中北大学 软件学院,太原 030051 2.太原科技大学 计算机科学与技术学院,太原 030024
摘    要:针对频繁导出式子树的特点,给出一种基于编码的频繁导出式子树挖掘算法。该算法通过宽度优先编码来表示原始数据库,使单个投影的规模最小;通过对每个投影编码降低了整个投影库的规模,从而有效地提高了频繁导出式子树的挖掘效率。实验结果验证了该算法具有较高的挖掘效率。

关 键 词:数据挖掘  频繁导出式子树  投影库  编码  
修稿时间: 

Frequent induced subtree mining algorithm using encoding
YIN Siqing,KONG Pengcheng,ZHANG Sulan. Frequent induced subtree mining algorithm using encoding[J]. Computer Engineering and Applications, 2011, 47(24): 121-124. DOI: 10.3778/j.issn.1002-8331.2011.24.034
Authors:YIN Siqing  KONG Pengcheng  ZHANG Sulan
Affiliation:1.School of Software,North University of China,Taiyuan 030051,China 2.School of Computer Science and Technology,Taiyuan University of Science and Technology,Taiyuan 030024,China
Abstract:According to the characteristics of frequent induced sub-tree,a mining algorithm based on encoding,called EFITM algorithm,is presented.Width-first encoding is used to express the initial database,which minimizes the encoding size of ev-ery single projection in the project database.The intervals with encoding are used to denote the project database of the node on the right-most path of the subtree,and the size of the whole project database is decreased.Experimental results show the correctness and the validity of the EFITM algorithm.
Keywords:data mining  frequent induced subtree  project database  encoding
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号