期刊文献+

XML空间频繁变化结构挖掘方法 被引量:1

Mining Spatial Frequently Changing Structures of XML
下载PDF
导出
摘要 XML数据在实际使用过程中不断发生改变,针对XML数据动态可变的特点,提出一种根据XML数据变化过程挖掘XML空间频繁变化结构SFCS(Spatial Frequently Changing Structure)的方法,首先提出XML子结构空间度量方法,通过结构空间变化度SSCD、版本空间变化度VSCD和空间变化程度SCD这3个度量值衡量XML子结构的空间变化频繁性并提出SFCS定义.进一步,提出一种用于保存XML空间变化信息和发现SFCS的数据模型SC-DOM,论证了XML编辑操作对子结构空间的影响并据此提出SC-DOM状态动态迁移方式,最后提出根据SC-DOM发现SFCS的算法并讨论算法复杂度.实验结果表明SFCS是频繁变化的结构,使用SC-DOM模型进行SFCS挖掘是有效且可扩展的. In practice, XML data changes itself frequently. According to the dynamic character istic of XML, this paper proposes a method to mining SFCS (Spatial Frequently Changing Struc- ture) from historical structural changing process of XML data. First, this paper proposes a meth- od to measure the spatial changing frequency by using structural spatial changing degree (SSCD), version spatial changing degree (VSCD) and spatial changing degree (SCD), and proposes the definition of SFCS. Further, it proposes a data model called SC-DOM used to store XML change information and discover SFCS, demonstrates the effect of editing operations to space of substructures of XML, and defines the maintenance method of SC-DOM. Finally, it proposes the algorithm to mining SFCS base on SC-DOM and discusses the complexity of the algorithm. Experimental results show that the SFCS is a frequent, as well as mining SFCS based on the SC-DOM is effective and scalable.
出处 《计算机学报》 EI CSCD 北大核心 2013年第2期317-326,共10页 Chinese Journal of Computers
基金 国家科技支撑计划项目(2006BAK01A33) 吉林省科技发展计划项目(20090704) 吉林省自然科学基金项目(201115020)资助~~
关键词 数据挖掘 XML 频繁模式 空间频繁变化结构 SC-DOM data mining XML frequent pattern spatial frequently changing structure SC-DOM
  • 相关文献

参考文献25

  • 1Abiteboul S, Buneman P, Suciu D. Data on the Web. SanFrancisco: Morgan Kaufmann, 2000.
  • 2Han J, Pei J, Yin Y et al. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 2004, 8(1): 53-87.
  • 3Han J, Cheng H, Xin D et al. Frequent pattern mining: Current status and future directions. Data Mining and Knowledge Discovery, 2007, 15(1).- 55-86.
  • 4Zaki M. Efficiently mining frequent trees in a forest: Algo- rithms and applications. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(8): 1021-1035.
  • 5Yan X, Han J. gSpan: Graph-based substructure pattern mining//Proceedings of the 2nd IEEE International Confer ence on Data Mining (ICDM' 02). Washington, 2002 : 721- 724.
  • 6Kutty S, Nayak R, Li Y. PCITMiner: Prefix-based closed induced tree miner for finding closed induced frequent sub- trees//Proceedings of the 6th Australasian Conference on Data Mining and Analytics. Queensland, Australia, 2007: 151 160.
  • 7Chi Yun, Xia Yi, Yang Yirong et al. Mining closed and max imal frequent subtrees from databases of labeled rooted trees. IEEE Transactions on Knowledge and Data Engineering 2005, 17(2).- 190 202.
  • 8Paik J, Nam J, Won D et al. Fast extraction of maximal frequent subtrees using bits representation. Journal of Infor- mation Science and Engineering, 2009, 25(2): 435-464.
  • 9Termier A, Rousset M C, Sebag M et al. DryadeParent, an efficient and robust closed attribute tree mining algorithm. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(3) : 300-320.
  • 10Balzar J, Bifet A, Lozano A. Mining frequent closed rooted trees. Machine Learning, 2010, 78(1): 1-33.

同被引文献6

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部