Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aggarwal CC, Wang H, editors. Managing and mining graph data, 1st ed. New York: Springer; 2010.
Chakrabarti D, Faloutsos C, editors. Graph mining: laws, tools, and case studies, 1st ed. San Rafael: Morgan & Claypool Publishers; 2012.
Cheng J, Ke Y, Chu S, Ozsu MT. Efficient core decomposition in massive networks. In: Proceedings of the 27th International Conference on Data Engineering; 2011. p. 51–62.
Cheng J, Ke Y, Fu A, Yu JX, Zhu L. Finding maximal cliques in massive networks by h*-graph. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2010. p. 447–58.
Cook DJ, Holder LB, editors. Mining graph data, 1st ed. New Jersey: Wiley-Interscience; 2006.
Huan J, Wang W, Prins J, Yang J. SPIN: mining maximal frequent subgraphs from graph databases. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2004. p. 581–86.
Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the 2nd European Conference on Principles of Data Mining and Knowledge Discovery; 1998. p. 13–23.
Jin N, Wang W. LTS: discriminative subgraph mining by learning from search history. In: Proceedings of the 27th International Conference on Data Engineering; 2011. p. 207–18.
Kuramochi M, Karypis G. Frequent subgraph discovery. In: Proceedings of the 1st IEEE International Conference on Data Mining; 2001. p. 313–20.
Kuramochi M, Karypis G. Finding frequent patterns in a large sparse graph. Data Min Knowl Discov. 2005;11(3):243–271.
Thomas L, Valluri S, Karlapalem K. MARGIN: maximal frequent subgraph mining. In: Proceedings of the 6th IEEE International Conference on Data Mining; 2006. p. 1097–1101.
Tsourakakis CE, Bonchi F, Gionis A, Gullo F, Tsiarli MA. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2013. p. 104–12.
Wang J, Cheng J. Truss decomposition in massive networks. Proc VLDB Endowment. 2012;5(9):812–823.
Yan X, Cheng H, Han J, Yu PS. Mining significant graph patterns by scalable leap search. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2008. p. 433–44.
Yan X, Han J. gSpan: graph-based substructure pattern mining. In: Proceedings of the 2nd IEEE International Conference on Data Mining; 2002. p. 721–24.
Yan X, Han J. CloseGraph: mining closed frequent graph patterns. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; 2003. p. 286–95.
Yan X, Yu PS, Han J. Graph indexing: a frequent structure-based approach. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004. p. 335–46.
Yu PS, Han J, Faloutsos C, editors. Link mining: models, algorithms, and applications, 1st ed. New York: Springer; 2010.
Zhang Y, Parthasarathy S. Extracting analyzing and visualizing triangle k-core motifs within networks. In: Proceedings of the 28th International Conference on Data Engineering; 2012. p. 1049–60.
Zhao P, Yu JX, Yu PS. Graph indexing: tree + delta > = graph. In: Proceedings of the 33rd International Conference on Very Large Data Bases; 2007. p. 938–49.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Cheng, H., Yu, J.X. (2018). Graph Mining. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_80737
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_80737
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering