{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:30:24Z","timestamp":1758702624529,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T00:00:00Z","timestamp":1554940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100011102","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["615517"],"award-info":[{"award-number":["615517"]}],"id":[{"id":"10.13039\/100011102","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10618-019-00627-1","type":"journal-article","created":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T16:04:37Z","timestamp":1554998677000},"page":"1088-1124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Subjectively interesting connecting trees and forests"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7820-6883","authenticated-orcid":false,"given":"Florian","family":"Adriaens","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2930-5057","authenticated-orcid":false,"given":"Jefrey","family":"Lijffijt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2692-7504","authenticated-orcid":false,"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,11]]},"reference":[{"key":"627_CR1","doi-asserted-by":"crossref","unstructured":"Adriaens F, Lijffijt J, De Bie 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, September 18\u201322, 2017, Proceedings, Part II, vol 10535, pp 53\u201369. Springer, Berlin","DOI":"10.1007\/978-3-319-71246-8_4"},{"key":"627_CR2","doi-asserted-by":"crossref","unstructured":"Akoglu L, Chau DH, Faloutsos C, Tatti N, Tong H, Vreeken J (2013) Mining connection pathways for marked nodes in large graphs. In Proceedings of SDM, pp 37\u201345","DOI":"10.1137\/1.9781611972832.5"},{"key":"627_CR3","unstructured":"Anglani R, Barile M (2007) Factorials as sums. arXiv:math\/0702010"},{"key":"627_CR4","first-page":"376","volume":"23","author":"A Cayley","year":"1889","unstructured":"Cayley A (1889) A theorem on trees. Q J Math 23:376\u2013378","journal-title":"Q J Math"},{"key":"627_CR5","unstructured":"Charikar M, Chekuri C, Cheung TY, Dai Z, Goel A, Guha S, Li M (1998) Approximation algorithms for directed steiner problems. In Proceedings of SODA, pp 192\u2013200"},{"key":"627_CR6","doi-asserted-by":"crossref","unstructured":"De Bie T (2011) An information theoretic framework for data mining. In Proceedings of KDD, pp 564\u2013572","DOI":"10.1145\/2020408.2020497"},{"issue":"3","key":"627_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T Bie De","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","journal-title":"Data Min Knowl Discov"},{"key":"627_CR8","doi-asserted-by":"crossref","unstructured":"De Bie T (2013) Subjective interestingness in exploratory data mining. In Proceedings of IDA, pp 19\u201331","DOI":"10.1007\/978-3-642-41398-8_3"},{"issue":"1","key":"627_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0378-8733(88)90011-1","volume":"10","author":"MG Everett","year":"1988","unstructured":"Everett MG, Borgatti S (1988) Calculating role similarities: an algorithm that helps determine the orbits of a graph. Soc Netw 10(1):77\u201391","journal-title":"Soc Netw"},{"key":"627_CR10","doi-asserted-by":"crossref","unstructured":"Faloutsos C, McCurley KS, Tomkins A (2004) Fast discovery of connection subgraphs. In Proceedings of the Tenth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, USA, KDD \u201904, pp 118\u2013127","DOI":"10.1145\/1014052.1014068"},{"issue":"3","key":"627_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3):75\u2013174","journal-title":"Phys Rep"},{"key":"627_CR12","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-57586-5_22","volume-title":"Algorithms and complexity","author":"M F\u00fcrer","year":"2017","unstructured":"F\u00fcrer M (2017) On the combinatorial power of the Weisfeiler\u2013Lehman algorithm. In: Fotakis D, Pagourtzis A, Paschos VT (eds) Algorithms and complexity. Springer, Cham, pp 260\u2013271"},{"key":"627_CR13","unstructured":"Goldberg AV (1984) Finding a maximum density subgraph. Tech. Rep. UCB\/CSD-84-171, EECS Department, University of California, Berkeley"},{"key":"627_CR14","unstructured":"Hauptmann M, Karpi\u0144ski M (2013) A Compendium on Steiner Tree Problems. Research report, Inst. f\u00fcr Informatik"},{"key":"627_CR15","unstructured":"Horng\u00a0Chau D, Akoglu L, Vreeken J, Tong H, Faloutsos C (2012) Tourviz: Interactive visualization of connection pathways in large graphs. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1516\u20131519"},{"key":"627_CR16","doi-asserted-by":"crossref","unstructured":"Kersting K, Mladenov M, Garnett R, Grohe M (2014) Power iterated color refinement. In Proceedings of the Twenty-Eighth AAAI conference on artificial intelligence, AAAI Press, AAAI\u201914, pp 1904\u20131910","DOI":"10.1609\/aaai.v28i1.8992"},{"key":"627_CR17","volume-title":"Combinatorial optimization: theory and algorithms","author":"B Korte","year":"2007","unstructured":"Korte B, Vygen J (2007) Combinatorial optimization: theory and algorithms, 4th edn. Springer, Berlin","edition":"4"},{"key":"627_CR18","doi-asserted-by":"crossref","unstructured":"Langohr L, Toivonen H (2012) A model for mining relevant and non-redundant information. In Proceedings of the ACM symposium on applied computing, pp 132\u2013137","DOI":"10.1145\/2245276.2245304"},{"key":"627_CR19","volume-title":"Managing and mining graph data","author":"VE Lee","year":"2010","unstructured":"Lee VE, Ruan N, Jin R, Aggarwal CC (2010) A survey of algorithms for dense subgraph discovery. In: Aggarwal CC, Wang H (eds) Managing and mining graph data. Springer, Berlin"},{"key":"627_CR20","unstructured":"McKay BD, Piperno A (2013) Practical graph isomorphism, II. arXiv:1301.1493"},{"issue":"7","key":"627_CR21","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.cor.2005.08.009","volume":"34","author":"V Melkonian","year":"2007","unstructured":"Melkonian V (2007) New primal\u2013dual algorithms for steiner tree problems. Comput Op Res 34(7):2147\u20132167","journal-title":"Comput Op Res"},{"key":"627_CR22","unstructured":"Moon J (1970) Counting labelled trees. Canadian mathematical monographs, Canadian mathematical congress"},{"key":"627_CR23","volume-title":"Entropy, orbits, and spectra of graphs, in analysis of complex networks: from biology to linguistics","author":"A Mowshowitz","year":"2009","unstructured":"Mowshowitz A, Mitsou V (2009) Entropy, orbits, and spectra of graphs, in analysis of complex networks: from biology to linguistics. Wiley-VCH Verlag GmbH & Co, KGaA, Weinheim"},{"issue":"20","key":"627_CR24","doi-asserted-by":"publisher","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","volume":"89","author":"ME Newman","year":"2002","unstructured":"Newman ME (2002) Assortative Mixing in Networks. Phys Rev Lett 89(20):208701","journal-title":"Phys Rev Lett"},{"issue":"2","key":"627_CR25","first-page":"026126","volume":"67","author":"ME Newman","year":"2003","unstructured":"Newman ME (2003) Mixing patterns in networks. Phys Rev Lett 67(2):026126","journal-title":"Phys Rev Lett"},{"issue":"2","key":"627_CR26","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/1117454.1117462","volume":"7","author":"C Ramakrishnan","year":"2005","unstructured":"Ramakrishnan C, Milnor WH, Perry M, Sheth AP (2005) Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explor Newsl 7(2):56\u201363","journal-title":"SIGKDD Explor Newsl"},{"key":"627_CR27","first-page":"73","volume":"4","author":"A R\u00e9nyi","year":"1959","unstructured":"R\u00e9nyi A (1959) Some remarks on the theory of trees. Publ Math Inst Hung Acad Sci 4:73\u201385","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"627_CR28","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen J (1978) Modeling by shortest data description. Automatica 14:465\u2013471","journal-title":"Automatica"},{"key":"627_CR29","volume-title":"A first course in abstract algebra: with applications","author":"J Rotman","year":"2006","unstructured":"Rotman J (2006) A first course in abstract algebra: with applications. Pearson Prentice Hall, Upper Saddle River"},{"key":"627_CR30","doi-asserted-by":"crossref","unstructured":"Rozenshtein P, Gionis A, Prakash BA, Vreeken J (2016) Reconstructing an epidemic over time. In Proceedings of KDD, pp 1835\u20131844","DOI":"10.1145\/2939672.2939865"},{"key":"627_CR31","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1515\/jib-2008-100","volume":"5","author":"P Sevon","year":"2008","unstructured":"Sevon P, Eronen L (2008) Subgraph queries by context-free grammars. J Integr Bioinform 5:157\u2013172","journal-title":"J Integr Bioinform"},{"key":"627_CR32","unstructured":"Silberschatz A, Tuzhilin A (1996) On subjective measures of interestingness in knowledge discovery. In Proceedings of KDD, pp 275\u2013281"},{"key":"627_CR33","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 KDD, pp 990\u2013998","DOI":"10.1145\/1401890.1402008"},{"issue":"1","key":"627_CR34","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10994-015-5539-3","volume":"105","author":"M Leeuwen van","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","journal-title":"Mach Learn"},{"key":"627_CR35","doi-asserted-by":"crossref","unstructured":"Watel D, Weisser MA (2014) A practical greedy approximation for the directed steiner tree problem. In Proceedings of COCOA, pp 200\u2013215","DOI":"10.1007\/978-3-319-12691-3_16"},{"issue":"1","key":"627_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3047017","volume":"12","author":"H Wu","year":"2018","unstructured":"Wu H, Sun M, Mi P, Tatti N, North C, Ramakrishnan N (2018) Interactive discovery of coordinated relationship chains with maximum entropy models. ACM Trans Knowl Discov Data 12(1):1\u201334","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"4","key":"627_CR37","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"WW Zachary","year":"1977","unstructured":"Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33(4):452\u2013473","journal-title":"J Anthropol Res"},{"key":"627_CR38","doi-asserted-by":"crossref","unstructured":"Zhou F, Malher S, Toivonen H (2010) Network simplification with minimal loss of connectivity. In 2010 IEEE international conference on data mining, pp 659\u2013668","DOI":"10.1109\/ICDM.2010.133"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00627-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00627-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00627-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T19:56:14Z","timestamp":1663271774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00627-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,11]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["627"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00627-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2019,4,11]]},"assertion":[{"value":"6 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}