Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Graph Mining

  • Hong Cheng
  • Jeffrey Xu Yu
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_80737

Synonyms

Graph pattern mining; Subgraph mining

Definition

Graph mining is defined in general as mining non-trivial graph structures from a single graph or a collection of graphs. Frequent subgraph mining is a typical example of graph mining problems, and is defined as follows. Given a graph data set D = {G1, G2, …, Gn} where Gi = (Vi, Ei) (1 ≤ in) is a graph with a vertex set Vi and an edge set Ei, find all subgraphs whose support is no less than a user-specified minimum support threshold, where the support of a subgraph g is the number of graphs in D that g is subgraph isomorphic to.

Historical Background

Frequent subgraph mining was first studied by Inokuchi et al. [7], Kuramochi and Karypis [9], Yan and Han [15], and so on, with applications in chemical compound and protein structure analysis. After that, there has been extensive research in the literature that studies mining various forms of graph patterns, such as closed subgraph [16], maximal subgraph [6, 11], significant...

This is a preview of subscription content, log in to check access.

References

  1. 1.
    Aggarwal CC, Wang H, editors. Managing and mining graph data, 1st ed. New York: Springer; 2010.zbMATHGoogle Scholar
  2. 2.
    Chakrabarti D, Faloutsos C, editors. Graph mining: laws, tools, and case studies, 1st ed. San Rafael: Morgan & Claypool Publishers; 2012.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Cook DJ, Holder LB, editors. Mining graph data, 1st ed. New Jersey: Wiley-Interscience; 2006.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.CrossRefGoogle Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Kuramochi M, Karypis G. Frequent subgraph discovery. In: Proceedings of the 1st IEEE International Conference on Data Mining; 2001. p. 313–20.Google Scholar
  10. 10.
    Kuramochi M, Karypis G. Finding frequent patterns in a large sparse graph. Data Min Knowl Discov. 2005;11(3):243–271.MathSciNetCrossRefGoogle Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    Wang J, Cheng J. Truss decomposition in massive networks. Proc VLDB Endowment. 2012;5(9):812–823.CrossRefGoogle Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    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.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    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.Google Scholar
  18. 18.
    Yu PS, Han J, Faloutsos C, editors. Link mining: models, algorithms, and applications, 1st ed. New York: Springer; 2010.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    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.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Systems Engineering and Engineering ManagementThe Chinese University of Hong KongHong KongChina