Managing and Mining Graph Data
作者： Editors-Aggarwal , Wang , Contributors-Chakrabarti , Faloutsos , McGlohon
DOI: 10.1007/978-1-4419-6045-0
关键词:
摘要: Managing and Mining Graph Data is a comprehensive survey book in graph data analytics. It contains extensive surveys on important topics such as languages, indexing, clustering, generation, pattern mining, classification, keyword search, matching, privacy. also studies number of domain-specific scenarios stream web graphs, social networks, chemical biological data. The chapters are written by leading researchers, provide broad perspective the area. This first emerging topic processing. designed for varied audience composed professors, researchers practitioners industry. volume suitable reference advanced-level database students computer science. About Editors:Charu C. Aggarwal obtained his B.Tech Computer Science from IIT Kanpur 1993 Ph.D. MIT 1996. He has worked researcher at IBM since then, published over 130 papers major mining conferences journals. applied or been granted 70 US International patents, thrice designated Master Inventor IBM. received an Corporate award work analytics, Outstanding Innovation Award privacy technology. served executive committees most conferences. associate editor IEEE TKDE, ACM SIGKDD Explorations, action DMKD Journal. fellow IEEE, life-member ACM. Haixun Wang currently Microsoft Research Asia. B.S. M.S. degree, both science, Shanghai Jiao Tong University 1994 degree science California, Los Angeles 2000. subsequently IBMuntil 2009. His main research interest language systems, information retrieval. more than 100 referred international journals conference proceedings. serves reviewer program committee member
core.ac.uk
springer.com
sci-hub.se 参考文章(321)
Siegfried Nijssen, Joost N. Kok, A quickstart in frequent structure mining can make a difference knowledge discovery and data mining. pp. 647- 652 ,(2004) , 10.1145/1014052.1014134
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash, Fast incremental proximity search in large graphs Proceedings of the 25th international conference on Machine learning - ICML '08. pp. 896- 903 ,(2008) , 10.1145/1390156.1390269
Lin Guo, Feng Shao, Chavdar Botev, Jayavel Shanmugasundaram, XRANK: ranked keyword search over XML documents international conference on management of data. pp. 16- 27 ,(2003) , 10.1145/872757.872762
Qiang Zhang, Ingo Muegge, Scaffold hopping through virtual screening using 2D and 3D similarity descriptors: ranking, voting, and consensus scoring. Journal of Medicinal Chemistry. ,vol. 49, pp. 1536- 1548 ,(2006) , 10.1021/JM050468I
H Bunke, G Allermann, Inexact graph matching for structural pattern recognition Pattern Recognition Letters. ,vol. 1, pp. 245- 253 ,(1983) , 10.1016/0167-8655(83)90033-8
Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos, On power-law relationships of the Internet topology acm special interest group on data communication. ,vol. 29, pp. 251- 262 ,(1999) , 10.1145/316188.316229
James B. Orlin, Thomas L. Magnanti, Ravindra K. Ahuja, Network Flows: Theory, Algorithms, and Applications ,(1993)
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Dandapani Sivakumar, Andrew Tompkins, Eli Upfal, None, The Web as a graph symposium on principles of database systems. pp. 1- 10 ,(2000) , 10.1145/335168.335170
Hao He, Haixun Wang, Jun Yang, Philip S. Yu, BLINKS Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07. pp. 305- 316 ,(2007) , 10.1145/1247480.1247516
M. E. J. Newman, Stephanie Forrest, Justin Balthrop, Email networks and the spread of computer viruses. Physical Review E. ,vol. 66, pp. 035101- ,(2002) , 10.1103/PHYSREVE.66.035101