{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T09:57:54Z","timestamp":1758707874706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319235240"},{"type":"electronic","value":"9783319235257"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23525-7_13","type":"book-chapter","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T08:20:13Z","timestamp":1440750013000},"page":"206-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The Difference and the Norm \u2014 Characterising Similarities and Differences Between Databases"],"prefix":"10.1007","author":[{"given":"Kailash","family":"Budhathoki","sequence":"first","affiliation":[]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Han, J. (eds.): Frequent Pattern Mining. Springer (2014)","DOI":"10.1007\/978-3-319-07821-2"},{"key":"13_CR2","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience New York (2006)"},{"issue":"3","key":"13_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":"13_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-30214-8_22","volume-title":"Discovery Science","author":"Floris Geerts","year":"2004","unstructured":"Geerts, Floris, Goethals, Bart, Mielik\u00e4inen, Taneli: Tiling databases. In: Suzuki, Einoshin, Arikawa, Setsuo (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 278\u2013289. Springer, Heidelberg (2004)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnwald, P.: The Minimum Description Length Principle. MIT Press (2007)","DOI":"10.7551\/mitpress\/4643.001.0001"},{"issue":"1","key":"13_CR6","first-page":"3","volume":"1","author":"AN Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problemy Peredachi Informatsii 1(1), 3\u201311 (1965)","journal-title":"Problemy Peredachi Informatsii"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer (1993)","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2382577.2382580","volume":"6","author":"M Mampaey","year":"2012","unstructured":"Mampaey, M., Vreeken, J., Tatti, N.: Summarizing data succinctly with the most informative itemsets. ACM TKDD 6, 1\u201344 (2012)","journal-title":"ACM TKDD"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Miettinen, P.: On finding joint subspace Boolean matrix factorizations. In: SDM, pp. 954\u2013965. SIAM (2012)","DOI":"10.1137\/1.9781611972825.82"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Nijssen, P., Guns, T., De Raedt, L.: Correlated itemset mining in ROC space: a constraint programming approach. In: KDD, pp. 647\u2013656. Springer (2009)","DOI":"10.1145\/1557019.1557092"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory - ICDT\u201999","author":"N Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"issue":"1","key":"13_CR12","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.: Modeling by shortest data description. Automatica 14(1), 465\u2013471 (1978)","journal-title":"Automatica"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. Annals Stat. 11(2), 416\u2013431 (1983)","journal-title":"Annals Stat."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Smets, K., Vreeken, J.: Slim: Directly mining descriptive patterns. In: SDM, pp. 236\u2013247. SIAM (2012)","DOI":"10.1137\/1.9781611972825.21"},{"key":"13_CR15","unstructured":"Nikolaj, T., Jilles, V.: The long and the short of it: Summarizing event sequences with serial episodes. In: KDD. ACM (2012)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Characterising the difference. In: KDD, pp. 765\u2013774 (2007)","DOI":"10.1145\/1281192.1281274"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: Mining itemsets that compress. Data Min. Knowl. Disc. 23(1), 169\u2013214 (2011)","journal-title":"Data Min. Knowl. Disc."},{"key":"13_CR18","unstructured":"Wallace, C.S.: Statistical and inductive inference by minimum message length. Springer (2005)"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"CS Wallace","year":"1968","unstructured":"Wallace, C.S., Boulton, D.M.: An information measure for classification. Comput. J. 11(1), 185\u2013194 (1968)","journal-title":"Comput. J."},{"issue":"3","key":"13_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2601433","volume":"8","author":"G Webb","year":"2014","unstructured":"Webb, G., Vreeken, J.: Efficient discovery of the most interesting associations. ACM TKDD 8(3), 1\u201331 (2014)","journal-title":"ACM TKDD"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Zimmermann, A., Nijssen, S.: Supervised pattern mining and applications to classification. In: Aggarwal, C.C., Han, J. (eds.) Frequent Pattern Mining, pp. 425\u2013442. Springer (2014)","DOI":"10.1007\/978-3-319-07821-2_17"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23525-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T00:04:49Z","timestamp":1599437089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23525-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319235240","9783319235257"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23525-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}