{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:49:39Z","timestamp":1760708979419,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T00:00:00Z","timestamp":1452124800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Research Foundation Flanders (FWO)","award":["Postdoc mandate"],"award-info":[{"award-number":["Postdoc mandate"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council (ERC)","doi-asserted-by":"crossref","award":["FORSIE"],"award-info":[{"award-number":["FORSIE"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/M000060\/1"],"award-info":[{"award-number":["EP\/M000060\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10994-015-5539-3","type":"journal-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T13:57:38Z","timestamp":1452175058000},"page":"41-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Subjective interestingness of subgraph patterns"],"prefix":"10.1007","volume":"105","author":[{"given":"Matthijs","family":"van Leeuwen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eirini","family":"Spyropoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Mesnage","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,7]]},"reference":[{"key":"5539_CR1","doi-asserted-by":"publisher","unstructured":"Abello, J., Resende, M. G. C., & Sudarsky, S. (2002). Massive quasi-clique detection. In S. Rajsbaum (Ed.), LATIN 2002: Theoretical informatics. Lecture notes in computer science (Vol. 2286, pp. 598\u2013612). Berlin, Heidelberg:Springer. doi: 10.1007\/3-540-45995-2_51 .","DOI":"10.1007\/3-540-45995-2_51"},{"key":"5539_CR2","doi-asserted-by":"crossref","unstructured":"Bhuiyan, M., Mukhopadhyay, S., & Hasan, M. A. (2012). Interactive pattern mining on hidden data: a sampling-based solution. In Proceedings of CIKM\u201912 (pp. 95\u2013104).","DOI":"10.1145\/2396761.2396777"},{"key":"5539_CR3","doi-asserted-by":"crossref","unstructured":"Boley, M., Lucchese, C., Paurat, D., & G\u00e4rtner, T. (2011). Direct local pattern sampling by efficient two-step random procedures. In Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining, August 21\u201324, 2011, pp. 582\u2013590, San Diego, CA.","DOI":"10.1145\/2020408.2020500"},{"key":"5539_CR4","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 Proceedings of IDEA\u201913, ACM, New York, NY, pp. 27\u201335. doi: 10.1145\/2501511.2501517 .","DOI":"10.1145\/2501511.2501517"},{"key":"5539_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"key":"5539_CR6","doi-asserted-by":"crossref","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. Annals of Mathematical Statistics, 23, 493\u2013507.","journal-title":"Annals of Mathematical Statistics"},{"key":"5539_CR7","volume-title":"Elements of information theory","author":"TM Cover","year":"2012","unstructured":"Cover, T. M., & Thomas, J. A. (2012). Elements of information theory. New York: Wiley."},{"key":"5539_CR8","doi-asserted-by":"crossref","unstructured":"De Bie, T. (2011a). An information theoretic framework for data mining. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD\u201911) (pp. 564\u2013572).","DOI":"10.1145\/2020408.2020497"},{"issue":"3","key":"5539_CR9","doi-asserted-by":"crossref","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 Mining and Knowledge Discovery, 23(3), 407\u2013446.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5539_CR10","doi-asserted-by":"crossref","unstructured":"Dzyuba, V., & van Leeuwen, M. (2013). Interactive discovery of interesting subgroup sets. In Advances in intelligent data analysis XII\u201312th international symposium, IDA 2013, October 17\u201319, 2013. Proceedings, pp. 150\u2013161. London, UK.","DOI":"10.1007\/978-3-642-41398-8_14"},{"key":"5539_CR11","doi-asserted-by":"publisher","unstructured":"Dzyuba, V., van Leeuwen, M., Nijssen, S., & Raedt, L. D. (2014). Interactive learning of pattern rankings. International Journal on Artificial Intelligence Tools, 23(6), 1460026. doi: 10.1142\/S0218213014600264 .","DOI":"10.1142\/S0218213014600264"},{"issue":"1","key":"5539_CR12","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1073\/pnas.0605965104","volume":"104","author":"S Fortunato","year":"2007","unstructured":"Fortunato, S., & Barthelemy, M. (2007). Resolution limit in community detection. Proceedings of the National Academy of Sciences, 104(1), 36\u201341.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"5539_CR13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1132960.1132963","volume":"38","author":"L Geng","year":"2006","unstructured":"Geng, L., & Hamilton, H. J. (2006). Interestingness measures for data mining: A survey. ACM Computing Surveys, 38(3), 9.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"5539_CR14","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/1297332.1297338","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis, A., Mannila, H., Mielik\u00e4inen, T., & Tsaparas, P. (2007). Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data, 1(3), 14.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"5539_CR15","doi-asserted-by":"crossref","unstructured":"Goethals, B., Moens, S., & Vreeken, J. (2011). MIME: a framework for interactive visual pattern mining. In Proceedings of KDD\u201911 (pp. 757\u2013760).","DOI":"10.1145\/2020408.2020529"},{"key":"5539_CR16","volume-title":"Finding a maximum density subgraph","author":"AV Goldberg","year":"1984","unstructured":"Goldberg, A. V. (1984). Finding a maximum density subgraph. Berkeley, CA: University of California."},{"key":"5539_CR17","doi-asserted-by":"crossref","unstructured":"Hanhijarvi, S., Ojala, M., Vuokko, N., Puolam\u00e4ki, K., Tatti, N., & Mannila, H. (2009). Tell me something I don\u2019t know: Randomization strategies for iterative data mining. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD\u201909) (pp. 379\u2013388).","DOI":"10.1145\/1557019.1557065"},{"issue":"1","key":"5539_CR18","first-page":"730","volume":"2","author":"MA Hasan","year":"2009","unstructured":"Hasan, M. A., & Zaki, M. J. (2009). Output space sampling for graph patterns. PVLDB, 2(1), 730\u2013741.","journal-title":"PVLDB"},{"issue":"301","key":"5539_CR19","doi-asserted-by":"crossref","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. Journal of the American Statistical Association, 58(301), 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"issue":"5","key":"5539_CR20","first-page":"386","volume":"2","author":"KN Kontonasios","year":"2012","unstructured":"Kontonasios, K. N., Spyropoulou, E., & De Bie, T. (2012). Knowledge discovery interestingness measures based on unexpectedness. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 2(5), 386\u2013399.","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"issue":"1","key":"5539_CR21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1017\/S0269888905000408","volume":"20","author":"K McGarry","year":"2005","unstructured":"McGarry, K. (2005). A survey of interestingness measures for knowledge discovery. Knowledge Engineering Review, 20(1), 39\u201361.","journal-title":"Knowledge Engineering Review"},{"issue":"2","key":"5539_CR22","doi-asserted-by":"crossref","first-page":"026,113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"ME Newman","year":"2004","unstructured":"Newman, M. E., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical Review E, 69(2), 026,113.","journal-title":"Physical Review E"},{"issue":"3","key":"5539_CR23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S. B. (1983). Network structure and minimum degree. Social Networks, 5(3), 269\u2013287.","journal-title":"Social Networks"},{"issue":"1","key":"5539_CR24","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S. B., & Foster, B. L. (1978). A graph-theoretic generalization of the clique concept. Journal of Mathematical sociology, 6(1), 139\u2013154.","journal-title":"Journal of Mathematical sociology"},{"key":"5539_CR25","doi-asserted-by":"crossref","unstructured":"Spyropoulou, E., De Bie, T., & Boley, M. (2014). Mining interesting patterns in multi-relational data. Data Mining and Knowledge Discovery, 28(3), 808\u2013849.","DOI":"10.1007\/s10618-013-0319-9"},{"key":"5539_CR26","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C. E., Bonchi, F., Gionis, A., Gullo, F., & Tsiarli, M. A. (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 (KDD\u201913) (pp. 104\u2013112).","DOI":"10.1145\/2487575.2487645"},{"issue":"1","key":"5539_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T Uno","year":"2010","unstructured":"Uno, T. (2010). An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica, 56(1), 3\u201316.","journal-title":"Algorithmica"},{"key":"5539_CR28","doi-asserted-by":"crossref","unstructured":"van Leeuwen, M. (2014). Interactive data exploration using pattern mining. In Interactive knowledge discovery and data mining in biomedical informatics\u2014State-of-the-art and future challenges, LNCS, (vol 8401. pp. 169\u2013182). New York: Springer.","DOI":"10.1007\/978-3-662-43968-5_9"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5539-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-015-5539-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5539-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5539-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:07:36Z","timestamp":1553612856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-015-5539-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["5539"],"URL":"https:\/\/doi.org\/10.1007\/s10994-015-5539-3","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2016,1,7]]}}}