期刊文献+

基于图的文献引用关系挖掘算法的研究

Research on Mining Algorithm of Graph-based Literature Citation Relationship
下载PDF
导出
摘要 基于图结构的挖掘是数据挖掘的新的研究方向,根据相关内容定义了用图表示两个有关文献引用关系的概念,提出了用图挖掘解决文献间相似关系的衡量与解决方法,目的在于找寻以文献为结点构造的图形中结点和结点之间的相互关系,进而反映出文献和文献之间的相似关系与文献的权威度。将图挖掘技术应用在文献引用关系方面,并提出了比较新颖的挖掘算法,此算法适合于以文献为结点构造的有向无环图,并为将来继续研究此方向打下了基础。所得结论将在图挖掘理论研究和网络搜索引擎方面具有很高的实用价值。 The Mining based on graph structure is the new research direction of data mining. According to the related content, the paper defines two relevant citation relations, and based on graph mining, proposes a method of the measurement and solutions of the relation ship between similar papers. What this paper's purpose is to look for the interrelation between nodes and nodes in the graph where references is abstract to nodes, and then reflect the similar relations among the references and the authority of the reference. The technology of Graph Mining is applied in reference,and this paper's novel algorithm for Graph Mining which is suitable for the Directed Acyclic Graph, lays the foundation for continuing studying in the direction. The conclusions of the paper in research for theory of the Graph Mining and Search Engine have the strong practical value.
作者 杜蕾 杨艳 赵彩虹 谭龙 DU Lei, YANG Yan, ZHAO Caihong, TAN Long (Department of Computer Science and Technology, Heilongjiang University, Harbin 150080, China)
出处 《智能计算机与应用》 2011年第2X期63-65,共3页 Intelligent Computer and Applications
基金 黑龙江大学青年科学基金项目(QL200911),黑龙江省自然科学基金项目(F201011),黑龙江省教育厅科学技术研究面上项目资助(11551352).
关键词 数据挖掘 图挖掘 参考文献 相似度 Data Mining Graph Mining Reference Similar Degree
  • 相关文献

参考文献1

二级参考文献21

  • 1汪卫,周皓峰,袁晴晴,楼宇波,施伯乐.基于图论的频繁模式挖掘[J].计算机研究与发展,2005,42(2):230-235. 被引量:17
  • 2M Kuramochi,G Karypis.Frequent subgraph discovery[C].ICDM,San Jose,USA,2001.
  • 3X Yan,J Han.gSpan:Graph-based substructure pattern mining[C].ICDM,Maebashi City,Japan,2002.
  • 4X Yan,J Han,Closegraph:Mining closed frequent graph patterns[C].KDD-2003,Washington,USA,2003.
  • 5J Huan,W Wang,J Prins.Efficient mining of frequent subgraphs in the presence of isomorphism[C].ICDM,Melbourne.USA,2003.
  • 6X Yan,P S Yu,J Han.Graph indexing:A frequent structurebased approach[C].ACM SIGMOD 2004,Paris,France,2004.
  • 7X Yan,P S Yu,J Han.Substructure similarity search in graph databases[C].ACM SIGMOD 2005,Baltimore,USA,2005.
  • 8X Yan,P S Yu,J Han.Searching substructures with superimposed distance[C].ICDE'06,Atlanta,USA,2006.
  • 9C Faloutsos,K S McCurley,A Tomkins.Fast discovery of connection subgraphs[C].KDD-2004,Seattle,USA,2004.
  • 10M Deshpande,M Kuramochi,G Karypis.Frequent substructure-based approaches for classifying chemical compounds[J].IEEE Trans on Knowledge and Data Engineering,2005,17(8):1036-1050.

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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