{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T17:31:24Z","timestamp":1767893484320,"version":"3.49.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100011199","name":"FP7 Ideas: European Research Council","doi-asserted-by":"publisher","award":["FP7\/2007-2013"],"award-info":[{"award-number":["FP7\/2007-2013"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011199","name":"FP7 Ideas: European Research Council","doi-asserted-by":"publisher","award":["615517"],"award-info":[{"award-number":["615517"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G091017N"],"award-info":[{"award-number":["G091017N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"crossref","award":["G0F9816N"],"award-info":[{"award-number":["G0F9816N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["665501"],"award-info":[{"award-number":["665501"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["Onderzoeksprogramma Artificiele Intelligentie (AI) Vlaanderen"],"award-info":[{"award-number":["Onderzoeksprogramma Artificiele Intelligentie (AI) Vlaanderen"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The connectivity structure of graphs is typically related to the attributes of the vertices. In social networks for example, the probability of a friendship between any pair of people depends on a range of attributes, such as their age, residence location, workplace, and hobbies. The high-level structure of a graph can thus possibly be described well by means of patterns of the form \u2018the subgroup of all individuals with certain properties X are often (or rarely) friends with individuals in another subgroup defined by properties Y\u2019, ideally relative to their expected connectivity. Such rules present potentially actionable and generalizable insight into the graph. Prior work has already considered the search for dense subgraphs (\u2018communities\u2019) with homogeneous attributes. The first contribution in this paper is to generalize this type of pattern to densities between a<jats:italic>pair of subgroups<\/jats:italic>, as well as between<jats:italic>all pairs from a set of subgroups that partition the vertices<\/jats:italic>. Second, we develop a novel information-theoretic approach for quantifying the subjective interestingness of such patterns, by contrasting them with prior information an analyst may have about the graph\u2019s connectivity. We demonstrate empirically that in the special case of dense subgraphs, this approach yields results that are superior to the state-of-the-art. Finally, we propose algorithms for efficiently finding interesting patterns of these different types.<\/jats:p>","DOI":"10.1007\/s10618-020-00721-9","type":"journal-article","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T10:03:17Z","timestamp":1605002597000},"page":"321-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Mining explainable local and global subgraph patterns with surprising densities"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5160-2237","authenticated-orcid":false,"given":"Junning","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jefrey","family":"Lijffijt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,10]]},"reference":[{"key":"721_CR1","doi-asserted-by":"publisher","unstructured":"Adhikari B, Zhang Y, Bharadwaj A, Prakash BA (2017) Condensing temporal networks using propagation, pp 417\u2013425. https:\/\/doi.org\/10.1137\/1.9781611974973.47","DOI":"10.1137\/1.9781611974973.47"},{"key":"721_CR2","doi-asserted-by":"publisher","unstructured":"Adriaens F, Lijffijt J, De\u00a0Bie T (2017) Subjectively interesting connecting trees. In: Ceci M, Hollm\u00e9n J, Todorovski L, Vens C (eds) Machine learning and knowledge discovery in databases: European conference, ECML PKDD 2017, Skopje, Macedonia, Sept 18\u201322, 2017, Proceedings, Part II, Springer, vol 10535, pp 53\u201369. https:\/\/doi.org\/10.1007\/978-3-319-71246-8_4","DOI":"10.1007\/978-3-319-71246-8_4"},{"key":"721_CR3","doi-asserted-by":"publisher","unstructured":"Akoglu L, Tong H, Meeder B, Faloutsos C (2012) PICS: parameter-free identification of cohesive subgroups in large attributed graphs, pp 439\u2013450. https:\/\/doi.org\/10.1137\/1.9781611972825.38","DOI":"10.1137\/1.9781611972825.38"},{"issue":"51","key":"721_CR4","doi-asserted-by":"publisher","first-page":"21544","DOI":"10.1073\/pnas.0908800106","volume":"106","author":"S Aral","year":"2009","unstructured":"Aral S, Muchnik L, Sundararajan A (2009) Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks. Proc Natl Acad Sci 106(51):21544\u201321549. https:\/\/doi.org\/10.1073\/pnas.0908800106","journal-title":"Proc Natl Acad Sci"},{"issue":"1","key":"721_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/widm.1144","volume":"5","author":"M Atzmueller","year":"2015","unstructured":"Atzmueller M (2015) Subgroup discovery. WIREs Data Min Knowl Discov 5(1):35\u201349. https:\/\/doi.org\/10.1002\/widm.1144","journal-title":"WIREs Data Min Knowl Discov"},{"key":"721_CR6","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/j.ins.2015.05.008","volume":"329","author":"M Atzmueller","year":"2016","unstructured":"Atzmueller M, Doerfel S, Mitzlaff F (2016) Description-oriented community detection using exhaustive subgroup discovery. Inf Sci 329:965\u2013984. https:\/\/doi.org\/10.1016\/j.ins.2015.05.008","journal-title":"Inf Sci"},{"key":"721_CR7","doi-asserted-by":"publisher","unstructured":"Barbieri N, Bonchi F, Manco G (2014) Who to follow and why: link prediction with explanations. In: The 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201914, New York, NY, USA, Aug 24\u201327, 2014, pp 1266\u20131275. https:\/\/doi.org\/10.1145\/2623330.2623733","DOI":"10.1145\/2623330.2623733"},{"key":"721_CR8","doi-asserted-by":"publisher","unstructured":"Boley M, Mampaey M, Kang B, Tokmakov P, Wrobel S (2013) One click mining: interactive local pattern discovery through implicit preference and performance learning. In: IDEA \u201913 proceedings of the ACM SIGKDD workshop on interactive data exploration and analytics, ACM, New York, NY, USA 2013, pp 27\u201335. https:\/\/doi.org\/10.1145\/2501511.2501517","DOI":"10.1145\/2501511.2501517"},{"key":"721_CR9","unstructured":"Cantador I, Brusilovsky P, Kuflik T (2011) 2nd workshop on information heterogeneity and fusion in recommender systems (hetrec 2011) In: Proceedings of the 5th ACM conference on recommender systems. ACM, New York, NY, USA, RecSys 2011"},{"key":"721_CR10","unstructured":"Casiraghi G, Nanumyan V, Scholtes I, Schweitzer F (2016) Generalized hypergeometric ensembles: statistical hypothesis testing in complex networks. arXiv:1607.02441"},{"key":"721_CR11","doi-asserted-by":"publisher","first-page":"742","DOI":"10.14778\/1687627.1687711","volume":"2","author":"C Chen","year":"2009","unstructured":"Chen C, Lin CX, Fredrikson M, Christodorescu M, Yan X, Han J (2009) Mining graph patterns efficiently via randomized summaries. Proc VLDB Endow 2:742\u2013753","journal-title":"Proc VLDB Endow"},{"key":"721_CR12","unstructured":"Chen X, Kang B, Lijffijt J, De Bie T (2020) ALPINE: active link prediction using network embedding. arXiv e-prints arXiv:2002.01227"},{"issue":"2","key":"721_CR13","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/1921632.1921638","volume":"5","author":"H Cheng","year":"2011","unstructured":"Cheng H, Zhou Y, Yu JX (2011) Clustering large attributed graphs: a balance between structural and attribute similarities. ACM Trans Knowl Discov Data (TKDD) 5(2):12:1\u201312:33. https:\/\/doi.org\/10.1145\/1921632.1921638","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"4","key":"721_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H Chernoff","year":"1952","unstructured":"Chernoff H (1952) A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann Math Stat 23(4):493\u2013507. https:\/\/doi.org\/10.1214\/aoms\/1177729330","journal-title":"Ann Math Stat"},{"key":"721_CR15","doi-asserted-by":"publisher","unstructured":"De\u00a0Bie T (2011a) An information theoretic framework for data mining. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201911, pp 564\u2013572. https:\/\/doi.org\/10.1145\/2020408.2020497","DOI":"10.1145\/2020408.2020497"},{"issue":"3","key":"721_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T De Bie","year":"2011","unstructured":"De Bie T (2011b) Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min Knowl Discov 23(3):407\u2013446. https:\/\/doi.org\/10.1007\/s10618-010-0209-3","journal-title":"Data Min Knowl Discov"},{"key":"721_CR17","doi-asserted-by":"publisher","unstructured":"De\u00a0Bie T (2013) Subjective interestingness in exploratory data mining. In: Proceedings of the 12th international symposium on advances in intelligent data analysis XII\u2014volume 8207, Springer, Berlin, IDA 2013, pp 19\u201331. https:\/\/doi.org\/10.1007\/978-3-642-41398-8_3","DOI":"10.1007\/978-3-642-41398-8_3"},{"key":"721_CR18","doi-asserted-by":"crossref","unstructured":"Deng J, Kang B, Lijffijt J, Bie TD (2020) Explainable subgraphs with surprising densities: a subgroup discovery approach. In: Proceedings of the 2020 SIAM international conference on data mining, Cincinnati, Ohio, USA","DOI":"10.1137\/1.9781611976236.66"},{"key":"721_CR19","unstructured":"Fond TL, Neville J (2010) Randomization tests for distinguishing social influence and homophily effects. In: Proceedings of the 19th international conference on world wide web, WWW \u201910, ACM, pp 601\u2013610"},{"issue":"4","key":"721_CR20","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1177\/004912417800600401","volume":"6","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Segregation in social networks. Sociol Methods Res 6(4):411\u2013429. https:\/\/doi.org\/10.1177\/004912417800600401","journal-title":"Sociol Methods Res"},{"key":"721_CR21","unstructured":"Fronczak A (2012) Exponential random graph models. arxiv:1210.7828"},{"issue":"5\u20136","key":"721_CR22","doi-asserted-by":"publisher","first-page":"1586","DOI":"10.1007\/s10618-014-0373-y","volume":"28","author":"E Galbrun","year":"2014","unstructured":"Galbrun E, Gionis A, Tatti N (2014) Overlapping community detection in labeled graphs. Data Min Knowl Discov 28(5\u20136):1586\u20131610. https:\/\/doi.org\/10.1007\/s10618-014-0373-y","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"721_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2594455","volume":"5","author":"NZ Gong","year":"2014","unstructured":"Gong NZ, Talwalkar A, Mackey L, Huang L, Shin ECR, Stefanov E, Shi ER, Song D (2014) Joint link prediction and attribute inference using a social-attribute network. ACM Trans Intell Syst Technol 5(2):1\u201320. https:\/\/doi.org\/10.1145\/2594455","journal-title":"ACM Trans Intell Syst Technol"},{"key":"721_CR24","doi-asserted-by":"publisher","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2010) Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: 2010 IEEE international conference on data mining, pp 845\u2013850. https:\/\/doi.org\/10.1109\/ICDM.2010.95","DOI":"10.1109\/ICDM.2010.95"},{"key":"721_CR25","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-642-23780-5_46","volume-title":"Machine learning and knowledge discovery in databases","author":"S G\u00fcnnemann","year":"2011","unstructured":"G\u00fcnnemann S, Boden B, Seidl T (2011) DB-CSC: a density-based approach for subspace clustering in graphs with feature vectors. In: Gunopulos D, Hofmann T, Malerba D, Vazirgiannis M (eds) Machine learning and knowledge discovery in databases. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 565\u2013580"},{"key":"721_CR26","volume-title":"An introduction to exponential random graph modeling,","author":"JK Harris","year":"2013","unstructured":"Harris JK (2013) An introduction to exponential random graph modeling, vol 173. Sage Publications, Beverly Hills"},{"key":"721_CR27","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-642-38562-9_55","volume-title":"Web-age information management","author":"N Hassanlou","year":"2013","unstructured":"Hassanlou N, Shoaran M, Thomo A (2013) Probabilistic graph summarization. In: Wang J, Xiong H, Ishikawa Y, Xu J, Zhou J (eds) Web-age information management. Springer, Berlin, pp 545\u2013556"},{"issue":"3","key":"721_CR28","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10115-010-0356-2","volume":"29","author":"F Herrera","year":"2011","unstructured":"Herrera F, Carmona CJ, Gonz\u00e1lez P, del Jesus MJ (2011) An overview on subgroup discovery: foundations and applications. Knowl Inf Syst 29(3):495\u2013525. https:\/\/doi.org\/10.1007\/s10115-010-0356-2","journal-title":"Knowl Inf Syst"},{"issue":"301","key":"721_CR29","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Ame Stat Assoc 58(301):13\u201330. https:\/\/doi.org\/10.1080\/01621459.1963.10500830","journal-title":"J Ame Stat Assoc"},{"issue":"373","key":"721_CR30","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/01621459.1981.10477598","volume":"76","author":"PW Holland","year":"1981","unstructured":"Holland PW, Leinhardt S (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76(373):33\u201350. https:\/\/doi.org\/10.1080\/01621459.1981.10477598","journal-title":"J Am Stat Assoc"},{"key":"721_CR31","unstructured":"Lemmerich F, Becker M (2018) pysubgroup: easy-to-use subgroup discovery in python. In: Joint European conference on machine learning and knowledge discovery in databases, pp 658\u2013662"},{"key":"721_CR32","doi-asserted-by":"crossref","unstructured":"Li J, Wu L, Za\u00efane O, Liu H (2017) Toward personalized relational learning. In: Proceedings of the 17th SIAM international conference on data mining, SDM 2017, Society for Industrial and Applied Mathematics Publications, United States, pp 444\u2013452","DOI":"10.1137\/1.9781611974973.50"},{"issue":"3","key":"721_CR33","doi-asserted-by":"publisher","first-page":"62:1","DOI":"10.1145\/3186727","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu Y, Safavi T, Dighe A, Koutra D (2018) Graph summarization methods and applications: a survey. ACM Comput Surv (CSUR) 51(3):62:1\u201362:34. https:\/\/doi.org\/10.1145\/3186727","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"1","key":"721_CR34","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","volume":"27","author":"M McPherson","year":"2001","unstructured":"McPherson M, Smith-Lovin L, Cook JM (2001) Birds of a feather: Homophily in social networks. Annu Rev Sociol 27(1):415\u2013444. https:\/\/doi.org\/10.1146\/annurev.soc.27.1.415","journal-title":"Annu Rev Sociol"},{"key":"721_CR35","unstructured":"Meeng M, Knobbe A (2011) Flexible enrichment with cortana\u2013software demo. In: Proceedings of BeneLearn, pp 117\u2013119"},{"key":"721_CR36","doi-asserted-by":"publisher","unstructured":"Moser F, Colak R, Rafiey A, Ester M (2009) Mining cohesive patterns from graphs with feature vectors. In: Proceedings of the 2009 SIAM international conference on data mining, pp 593\u2013604. https:\/\/doi.org\/10.1137\/1.9781611972795.51","DOI":"10.1137\/1.9781611972795.51"},{"key":"721_CR37","unstructured":"Mougel PN, Plantevit M, Rigotti C, Gandrillon O, Boulicaut JF (2010) Constraint-based mining of sets of cliques sharing vertex properties. In: Workshop on analysis of complex networks ACNE\u201910 co-located with ECML PKDD 2010, Barcelona, Spain, pp 48\u201362. https:\/\/hal.archives-ouvertes.fr\/hal-01381539"},{"issue":"23","key":"721_CR38","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"M Newman","year":"2006","unstructured":"Newman M (2006) Modularity and community structure in networks. Proce Natl Acad Sci 103(23):8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proce Natl Acad Sci"},{"key":"721_CR39","doi-asserted-by":"publisher","first-page":"P03024","DOI":"10.1088\/1742-5468\/2009\/03\/p03024","volume":"03","author":"V Nicosia","year":"2009","unstructured":"Nicosia V, Mangioni G, Carchiolo V, Malgeri M (2009) Extending the definition of modularity to directed graphs with overlapping communities. J Stat Mech Theory Exp 03:P03024. https:\/\/doi.org\/10.1088\/1742-5468\/2009\/03\/p03024","journal-title":"J Stat Mech Theory Exp"},{"key":"721_CR40","doi-asserted-by":"publisher","unstructured":"Perozzi B, Akoglu L, Iglesias\u00a0S\u00e1nchez P, M\u00fcller E (2014) Focused clustering and outlier detection in large attributed graphs. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201914, pp 1346\u20131355. https:\/\/doi.org\/10.1145\/2623330.2623682","DOI":"10.1145\/2623330.2623682"},{"issue":"2","key":"721_CR41","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2517088","volume":"5","author":"S Pool","year":"2014","unstructured":"Pool S, Bonchi F, Leeuwen M (2014) Description-driven community detection. ACM Trans Intell Syst Technol (TIST) 5(2):28:1\u201328:28. https:\/\/doi.org\/10.1145\/2517088","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"issue":"12","key":"721_CR42","doi-asserted-by":"publisher","first-page":"3417","DOI":"10.1109\/TKDE.2015.2453957","volume":"27","author":"L Shi","year":"2015","unstructured":"Shi L, Tong H, Tang J, Lin C (2015) Vegas: visual influence graph summarization on citation networks. IEEE Trans Knowl Data Eng 27(12):3417\u20133431. https:\/\/doi.org\/10.1109\/TKDE.2015.2453957","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"721_CR43","doi-asserted-by":"crossref","unstructured":"Sinha A, Shen Z, Song Y, Ma H, Eide D, Hsu BP, Wang K (2015) An overview of Microsoft Academic Service (MAS) and applications. In: Proceedings of the 24th international conference on world wide web, ACM, pp 243\u2013246","DOI":"10.1145\/2740908.2742839"},{"key":"721_CR44","doi-asserted-by":"crossref","unstructured":"Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) ArnetMiner: extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, pp 990\u2013998","DOI":"10.1145\/1401890.1402008"},{"key":"721_CR45","doi-asserted-by":"publisher","unstructured":"Tian Y, Hankins RA, Patel JM (2008) Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201908, pp 567\u2013580. https:\/\/doi.org\/10.1145\/1376616.1376675","DOI":"10.1145\/1376616.1376675"},{"issue":"16","key":"721_CR46","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Physica A Stat Mech Appl 391(16):4165\u20134180. https:\/\/doi.org\/10.1016\/j.physa.2011.12.021","journal-title":"Physica A Stat Mech Appl"},{"key":"721_CR47","doi-asserted-by":"publisher","unstructured":"Tsourakakis C, Bonchi F, Gionis A, Gullo F, Tsiarli M (2013) 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, ACM, New York, NY, USA, KDD \u201913, pp 104\u2013112. https:\/\/doi.org\/10.1145\/2487575.2487645","DOI":"10.1145\/2487575.2487645"},{"issue":"1","key":"721_CR48","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10994-015-5539-3","volume":"105","author":"M van Leeuwen","year":"2016","unstructured":"van Leeuwen M, De Bie T, Spyropoulou E, Mesnage C (2016) Subjective interestingness of subgraph patterns. Mach Learn 105(1):41\u201375. https:\/\/doi.org\/10.1007\/s10994-015-5539-3","journal-title":"Mach Learn"},{"key":"721_CR49","doi-asserted-by":"crossref","unstructured":"Wang X, Jin D, Cao X, Yang L, Zhang W (2016) Semantic community identification in large attribute networks. In: Proceedings of the thirtieth AAAI conference on artificial intelligence, AAAI Press, AAAI\u201916, pp 265\u2013271. http:\/\/dl.acm.org\/citation.cfm?id=3015812.3015851","DOI":"10.1609\/aaai.v30i1.9977"},{"key":"721_CR50","doi-asserted-by":"publisher","unstructured":"Wei X, Xu L, Cao B, Yu PS (2017) Cross view link prediction by learning noise-resilient representation consensus. In: Proceedings of the 26th international conference on world wide web, International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, WWW \u201917, pp 1611\u20131619. https:\/\/doi.org\/10.1145\/3038912.3052575","DOI":"10.1145\/3038912.3052575"},{"key":"721_CR51","doi-asserted-by":"publisher","unstructured":"Wu Y, Zhong Z, Xiong W, Jing N (2014) Graph summarization for attributed graphs. In: 2014 International conference on information science, electronics and electrical engineering, vol 1, pp 503\u2013507. https:\/\/doi.org\/10.1109\/InfoSEEE.2014.6948163","DOI":"10.1109\/InfoSEEE.2014.6948163"},{"key":"721_CR52","doi-asserted-by":"publisher","unstructured":"Xu Z, Ke Y, Wang Y, Cheng H, Cheng J (2012) A model-based approach to attributed graph clustering. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data, ACM, New York, NY, USA, SIGMOD \u201912, pp 505\u2013516. https:\/\/doi.org\/10.1145\/2213836.2213894","DOI":"10.1145\/2213836.2213894"},{"issue":"1","key":"721_CR53","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10115-013-0693-z","volume":"42","author":"J Yang","year":"2015","unstructured":"Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42(1):181\u2013213. https:\/\/doi.org\/10.1007\/s10115-013-0693-z","journal-title":"Knowl Inf Syst"},{"key":"721_CR54","doi-asserted-by":"publisher","unstructured":"Yin Z, Gupta M, Weninger T, Han J (2010) A unified framework for link recommendation using random walks. In: 2010 international conference on advances in social networks analysis and mining, pp 152\u2013159. https:\/\/doi.org\/10.1109\/ASONAM.2010.27","DOI":"10.1109\/ASONAM.2010.27"},{"key":"721_CR55","doi-asserted-by":"publisher","unstructured":"Zhang N, Tian Y, Patel JM (2010) Discovery-driven graph summarization. In: 2010 IEEE 26th international conference on data engineering (ICDE 2010), pp 880\u2013891. https:\/\/doi.org\/10.1109\/ICDE.2010.5447830","DOI":"10.1109\/ICDE.2010.5447830"},{"issue":"1","key":"721_CR56","doi-asserted-by":"publisher","first-page":"718","DOI":"10.14778\/1687627.1687709","volume":"2","author":"Y Zhou","year":"2009","unstructured":"Zhou Y, Cheng H, Yu JX (2009) Graph clustering based on structural\/attribute similarities. Proc VLDB Endow 2(1):718\u2013729. https:\/\/doi.org\/10.14778\/1687627.1687709","journal-title":"Proc VLDB Endow"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00721-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-020-00721-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00721-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,27]],"date-time":"2022-11-27T13:24:14Z","timestamp":1669555454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-020-00721-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,10]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["721"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00721-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,10]]},"assertion":[{"value":"13 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}