Abstract
Graph databases have gained popularity in recent years because many data use graphs as easy and intuitive representations. The task of Graph Mining focuses on identifying statistically significant subgraphs, called patterns, in graph databases. This task has two parts: the search procedure itself, coupled with the help of a chosen support measure to evaluate the statistical significance of graph patterns. In this paper, we focus on the single-graph setting, where the database is a single large graph. We prove that all proper graph support measures correspond to flows in the network of instances, which provides the means for future classification of these measures.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13278-022-00955-z/MediaObjects/13278_2022_955_Fig1_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13278-022-00955-z/MediaObjects/13278_2022_955_Fig2_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13278-022-00955-z/MediaObjects/13278_2022_955_Fig3_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13278-022-00955-z/MediaObjects/13278_2022_955_Fig4_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs13278-022-00955-z/MediaObjects/13278_2022_955_Fig5_HTML.png)
Similar content being viewed by others
Notes
The third part of this definition—one that is usually given in textbooks and requires that \(f(u,v)=-f(v,u)\)—is redundant. Moreover, this condition can only be used in networks where the Lovász path switching operation (Lovász 1976) does not change flow size. For instance, this requirement does not hold when a network has three distinct source-sink pairs.
References
Babai L (2016) Graph isomorphism in quasipolynomial time. In: Proceedings of the forty-eighth annual ACM symposium on theory of computing. ACM, pp 684–697
Babai L (2018) Groups, graphs, algorithms: the graph isomorphism problem. In: Proceedings of the ICM, pp 3303–3320
Barbier G, Liu H (2011) Data mining in social media. In: Aggarwal CC (ed) Social network data analytics. Springer, Berlin, pp 327–352
Barua HB, Mondal KC (2019) A comprehensive survey on cloud data mining (CDM) frameworks and algorithms. ACM Comput Surv CSUR 52(5):104
Bollobás B (2013) Modern graph theory, vol 184. Springer, Berlin
Bringmann B, Nijssen S (2008) What is frequent in a single graph? In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 858–863
Buehrer G, Chellapilla K (2008) A scalable pattern mining approach to web graph compression with communities. In: Proceedings of the 2008 international conference on web search and data mining. ACM, pp 95–106
Calders T, Ramon J, Van Dyck D (2008) Anti-monotonic overlap-graph support measures. In: 2008 Eighth IEEE international conference on data mining. IEEE, pp 73–82
Chakrabarti D, Faloutsos C (2006) Graph mining: laws, generators, and algorithms. ACM Comput Surv CSUR 38(1):2
Chakrabarti S, Ester M, Fayyad U, Gehrke J, Han J, Morishita S, Piatetsky-Shapiro G, Wang W (2006) Data mining curriculum: a proposal (version 1.0). Intensive Working Group of ACM SIGKDD Curriculum Committee, vol 140, pp 1–10
Chaudhary N, Thakur HK (2018) Survey of algorithms based on dynamic graph mining. In: 2018 Fifth international conference on parallel, distributed and grid computing (PDGC). IEEE, pp 393–399
Cook DJ, Holder LB (2006) Mining graph data. Wiley, Hoboken
Fiedler M, Borgelt C (2007) Subgraph support in a single large graph. In: Seventh IEEE international conference on data mining workshops (ICDMW 2007). IEEE, pp 399–404
Gross JL, Yellen J (2004) Handbook of graph theory. CRC Press, Boca Raton
Hall P (2009) On representatives of subsets. In: Classic papers in combinatorics. Springer, pp 58–62
Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Elsevier, Amsterdam
Hand DJ (2006) Data mining. In: El-Shaarawi AH, Piegorsch WW, Piegorsch WW (eds) Encyclopedia of environmetrics, vol 1. Wiley, 2002. p 461
Jiang C, Coenen F, Sanderson R, Zito M (2010) Text classification using graph mining-based feature extraction. In: Research and development in intelligent systems XXVI. Springer, pp 21–34
Karp RM, Wigderson A (1985) A fast parallel algorithm for the maximal independent set problem. J ACM JACM 32(4):762–773
Karypis G, Aggarwal R, Kumar V, Shekhar S (1999) Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans Very Large Scale Integr VLSI Syst 7(1):69–79
Lomonosov MV (1985) Combinatorial approaches to multiflow problems. North-Holland, Amsterdam
Lovász L (1976) On some connectivity properties of Eulerian graphs. Acta Math Hung 28(1–2):129–138
Matousek J, Gärtner B (2007) Understanding and using linear programming. Springer, Berlin
Meng J, Tu YC (2017) Flexible and feasible support measures for mining frequent patterns in large labeled graphs. In: Proceedings of the 2017 ACM international conference on management of data. ACM, pp 391–402 (2017)
Meng J, Tu YC, Pitaksirianan N (2019) A new polynomial-time support measure for counting frequent patterns in graphs. In: Proceedings of the 31st international conference on scientific and statistical database management. ACM, pp 214–217
Menger K (1927) Zur allgemeinen kurventheorie. Fundam Math 10(1):96–115
Micali S, Vazirani VV (1980) An algorithm for finding maximum matching in general graphs. In: 21st Annual symposium on foundations of computer science (SFCS 1980). IEEE, pp 17–27
Mihalcea R, Tarau P (2004) Textrank: bringing order into text. In: Proceedings of the 2004 conference on empirical methods in natural language processing, pp 404–411
Mrzic A, Meysman P, Bittremieux W, Moris P, Cule B, Goethals B, Laukens K (2018) Grasping frequent subgraph mining for bioinformatics applications. BioData Min 11(1):20
Mucha M, Sankowski P (2004) Maximum matchings via Gaussian elimination. In: 45th Annual IEEE symposium on foundations of computer science. IEEE, pp 248–255
Papadimitriou CH (2003) Computational complexity. Wiley, Hoboken
Parthasarathy S, Tatikonda S, Ucar D (2010) A survey of graph mining techniques for biological datasets. In: Aggarwal CC, Wang H (eds) Managing and mining graph data. Springer, Berlin, pp 547–580
Vanetik N, Shimony SE, Gudes E (2006) Support measures for graph data. Data Min Knowl Discov 13(2):243–260
Wang JT, Zaki MJ, Toivonen HT, Shasha D (2005) Introduction to data mining in bioinformatics. In: Wu X, Jain L, Wang JTL, Zaki MJ, Toivonen HTT, Shasha D (eds) Data mining in bioinformatics. Springer, Berlin, pp 3–8
Wang Y, Guo ZC, Ramon J (2017) Learning from networked examples. In: International conference on algorithmic learning theory. PMLR, pp 641–666
Williams E, Gray J, Dixon B (2017) Improving geolocation of social media posts. Pervasive Mob Comput 36:68–79
Zuckerman D (1993) NP-complete problems have a version that’s hard to approximate. In: Proceedings of the eighth annual structure in complexity theory conference. IEEE, pp 305–312
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Vanetik, N. Graph support measures and flows. Soc. Netw. Anal. Min. 12, 120 (2022). https://doi.org/10.1007/s13278-022-00955-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-022-00955-z