期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于确定图的频繁子图挖掘技术概述

下载PDF
导出
摘要 化学信息学、生物信息学、医学和社会科学等领域的科学研究的迅速发展积累了大量的图数据,如何从复杂和庞大的图数据中挖掘出有效信息成为数据挖掘领域的热点。通过介绍现阶段图数据挖掘技术的进展,特别是确定图挖掘技术中有代表性的频繁子图挖掘技术研究,讨论并预测了频繁子图挖掘研究的发展趋势。
作者 黄鑫
机构地区 德宏师范高等专科学校
出处 《计算机光盘软件与应用》 2012年第17期63-64,共2页 Computer CD Software and Application
关键词 确定图 频繁子图挖掘 子图同构
分类号 TP311.13 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献7

  • 1丁悦,张阳,李战怀,王勇.图数据挖掘技术的研究与进展[J].计算机应用,2012,32(1):182-190. 被引量：14
  • 2Inokuchi A,Washio T,Motoda H. An apriori-based algorithm for mining frequent sub structures from graph data[A].Freiburg,Germany,2000.13-23.
  • 3Kuramochi M,Karypis G. Frequent subgraph discovery[A].San Jose,California,U.S.A,2001.313-320.
  • 4Yan Xifeng,Han Jiawei. gSpan:Graph-based substructure pattern mining[A].Washington,DC:IEEE Computer Society,2002.721-724.
  • 5Huan Jun,Wang Wei,Prins J. Efficient mining of frequent subgraphs in the presence of isomo- rphism[A].Washington,DC:IEEE Computer Society,2002.549-552.
  • 6Yan Xifeng,Han Jia Wei. Closegraph:Mining closed frequent graph patterns[A].New York:acm Press,2003.286-295.
  • 7KetKar S,Holder B,Cook J. Subdue:Compression-Based Frequent Pattern Discovery in Graph Data[A].2005.71-76.

二级参考文献114

  • 1周水庚 蔚赵春 蒋豪良.图结构数据搜索的概念、问题与进展[J].中国计算机学会通讯,2007,3(8):59-65.
  • 2DESHPANDE M, KURAMOCHI M, WALE N, et al. Frequent substructure-based approaches for classifying chemical compounds [ J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(8) : 1036 - 1050.
  • 3HUAN JUN, WANG WEI, BANDYOPADHYAY D, et al. Mining spatial motifs from protein structure graphs [ C]// Proceedings of the 8th Conference on Research in Computational Molecular Biology. New York: ACM Press, 2004:308 -315.
  • 4KOYUTURK M, GRAMA A, SZPANKOWSKI W. An efficient algorithm for detecting frequent subgraphs in biological networks [ J]. Bioinformatics, 2004, 20(1)" 200-207.
  • 5HU HAI-YAN, YAN XI-FENG, HUANG YU, et al. Mining coherent dense subgraphs across massive biological networks for functional discovery [J]. Bioinformatics, 2005, 21 (1) : 213 - 221.
  • 6BARABASI A L, ALBERT R. Emergence of scaling in random networks [J]. Science, 1999, 286(5439): 509-512.
  • 7FALOUTSOS M, FALOUTSOS P, FALOUTSOS C. On power law relationships of the Internet topology [ C]//Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication. New York: ACM Press, 1999: 251 - 262.
  • 8FABRIKANT A, KOUTSOUPIAS E, PAPADIMITRIOU C H. Heuristically optimized trade-offs: A new paradigm for power laws in the Internet [ C]// Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Berlin: Springer-Vedag, 2002:110 - 122.
  • 9KUMAR R, RAGHAVAN P, RAJAGOPALAN S, et al. Stochastic models for the Web graph [ C]// Proceedings of the 41st Annual Symposium on Foundations of Computer Science. Washington,DC: IEEE Computer Society, 2000:57-65.
  • 10BRIN S, PAGE L. The anatomy of a large scale hypertextual Web search engine [ C]// Proceedings of the 7th International Conference on World Wide Web 7. B. V. Amsterdam: Elsevier Science, 1998: 107-117.

共引文献13

计算机光盘软件与应用
2012年 第17期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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