{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:25:48Z","timestamp":1742948748556,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319712451"},{"type":"electronic","value":"9783319712468"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71246-8_4","type":"book-chapter","created":{"date-parts":[[2017,12,29]],"date-time":"2017-12-29T09:03:20Z","timestamp":1514538200000},"page":"53-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Subjectively Interesting Connecting Trees"],"prefix":"10.1007","author":[{"given":"Florian","family":"Adriaens","sequence":"first","affiliation":[]},{"given":"Jefrey","family":"Lijffijt","sequence":"additional","affiliation":[]},{"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Akoglu, L., Chau, D.H., Faloutsos, C., Tatti, N., Tong, H., Vreeken, J.: Mining connection pathways for marked nodes in large graphs. In: Proceedings of SDM, pp. 37\u201345 (2013)","DOI":"10.1137\/1.9781611972832.5"},{"key":"4_CR2","unstructured":"Charikar, M., Chekuri, C., Cheung, T.Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. In: Proceedings of SODA, pp. 192\u2013200 (1998)"},{"issue":"3","key":"4_CR3","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.: Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min. Knowl. Disc. 23(3), 407\u2013446 (2011)","journal-title":"Data Min. Knowl. Disc."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"De Bie, T.: An information theoretic framework for data mining. In: Proceedings of KDD, pp. 564\u2013572 (2011)","DOI":"10.1145\/2020408.2020497"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"De Bie, T.: Subjective interestingness in exploratory data mining. In: Proceedings of IDA, pp. 19\u201331 (2013)","DOI":"10.1007\/978-3-642-41398-8_3"},{"issue":"1","key":"4_CR6","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.: Subjective interestingness of subgraph patterns. Mach. Learn. 105(1), 41\u201375 (2016)","journal-title":"Mach. Learn."},{"issue":"7","key":"4_CR7","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.: New primal-dual algorithms for Steiner tree problems. Comput. Oper. Res. 34(7), 2147\u20132167 (2007)","journal-title":"Comput. Oper. Res."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Rozenshtein, P., Gionis, A., Prakash, B.A., Vreeken, J.: Reconstructing an epidemic over time. In: Proceedings of KDD, pp. 1835\u20131844 (2016)","DOI":"10.1145\/2939672.2939865"},{"key":"4_CR9","unstructured":"Silberschatz, A., Tuzhilin, A.: On subjective measures of interestingness in knowledge discovery. In: Proceedings of KDD, pp. 275\u2013281 (1996)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: ArnetMiner: extraction and mining of academic social networks. In: Proceedings of KDD, pp. 990\u2013998 (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Watel, D., Weisser, M.A.: A practical greedy approximation for the directed Steiner tree problem. In: Proceedings of COCOA, pp. 200\u2013215 (2014)","DOI":"10.1007\/978-3-319-12691-3_16"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71246-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T01:07:40Z","timestamp":1672276060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71246-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319712451","9783319712468"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71246-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"30 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Skopje","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macedonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2017.ijs.si\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}