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

基于XML的完全频繁查询模式挖掘算法
引用本文:陈超祥,叶时平,华成,金林樵. 基于XML的完全频繁查询模式挖掘算法[J]. 计算机应用, 2008, 28(6): 1450-1453
作者姓名:陈超祥  叶时平  华成  金林樵
作者单位:浙江树人大学,信息科技学院,杭州,310015;浙江大学,计算机科学与技术学院,杭州310027
摘    要:使用树结构建模对XML查询进行研究,提出了一种基于树同构的查询包含检测方法。采用最右分枝扩展方法,系统地枚举查询模式树的同根子树。在枚举过程中,采用Diffset结构记录包含同根子树的事务集的查询事务标识,并给出挖掘算法DiffFRSTMiner。实验结果证实了该算法合理、高效,并可以减少一定的内存开销。

关 键 词:XML  数据挖掘  频繁查询模式
文章编号:1001-9081(2008)06-1450-04
收稿时间:2007-12-04
修稿时间:2007-12-04

XML-based mining algorithm of complete frequent query pattern
CHEN Chao-xiang,YE Shi-ping,HUA Cheng,JIN Lin-qiao. XML-based mining algorithm of complete frequent query pattern[J]. Journal of Computer Applications, 2008, 28(6): 1450-1453
Authors:CHEN Chao-xiang  YE Shi-ping  HUA Cheng  JIN Lin-qiao
Affiliation:CHEN Chao-xiang1,YE Shi-ping1,HUA Cheng2,JIN Lin-qiao11.College of Information Science , Technology,Zhejiang Shuren University,Hangzhou Zhejiang 310015,China,2.College of Computer Science,Zhejiang University,Hangzhou Zhejiang 310027
Abstract:To study XML query with tree structure modeling, a query and detection method based on tree isomorphism was proposed, systematically enumerating the same root subtree of query pattern tree with the most right branch expansion. In the enumeration process, the Diffset data structure was used to record the query item logo of item set, and the DiffFRSTMiner mining algorithm was proposed. This item set includes the same root subtree. The experimental results prove that the algorithm is efficient, and can reduce definite memory overhead.
Keywords:XML  data mining  frequent query pattern
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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