{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T07:11:33Z","timestamp":1766301093407,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642238079"},{"type":"electronic","value":"9783642238086"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23808-6_26","type":"book-chapter","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T03:40:29Z","timestamp":1313638829000},"page":"398-413","source":"Crossref","is-referenced-by-count":4,"title":["Comparing Apples and Oranges"],"prefix":"10.1007","author":[{"given":"Nikolaj","family":"Tatti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/304182.304188","volume-title":"Proc. ACM SIGMOD 1999","author":"C.C. Aggarwal","year":"1999","unstructured":"Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S.: Fast algorithms for projected clustering. In: Proc. ACM SIGMOD 1999, pp. 61\u201372. ACM, New York (1999)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn (2006)","DOI":"10.1002\/047174882X"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1214\/aop\/1176996454","volume":"3","author":"I. Csisz\u00e1r","year":"1975","unstructured":"Csisz\u00e1r, I.: I-divergence geometry of probability distributions and minimization problems. Ann. Prob.\u00a03(1), 146\u2013158 (1975)","journal-title":"Ann. Prob."},{"issue":"5","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.1214\/aoms\/1177692379","volume":"43","author":"J. Darroch","year":"1972","unstructured":"Darroch, J., Ratcliff, D.: Generalized iterative scaling for log-linear models. Ann. Math. Stat.\u00a043(5), 1470\u20131480 (1972)","journal-title":"Ann. Math. Stat."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"De Bie, T.: Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min. Knowl. Disc. (2010)","DOI":"10.1007\/s10618-010-0209-3"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1666\/04087.1","volume":"32","author":"M. Fortelius","year":"2006","unstructured":"Fortelius, M., Gionis, A., Jernvall, J., Mannila, H.: Spectral ordering and biochronology of european fossil mammals. Paleobiology\u00a032(2), 206\u2013214 (2006)","journal-title":"Paleobiology"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Gallo, A., Miettinen, P., Mannila, H.: Finding subgroups having several descriptions: Algorithms for redescription mining. In: SDM 2008 (2008)","DOI":"10.1137\/1.9781611972788.30"},{"key":"26_CR8","series-title":"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":"F. Geerts","year":"2004","unstructured":"Geerts, F., Goethals, B., Mielik\u00e4inen, T.: Tiling databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 278\u2013289. Springer, Heidelberg (2004)"},{"key":"26_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-30116-5_18","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"A. Gionis","year":"2004","unstructured":"Gionis, A., Mannila, H., Sepp\u00e4nen, J.K.: Geometric and combinatorial tiles in 0-1 data. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol.\u00a03202, pp. 173\u2013184. Springer, Heidelberg (2004)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Hanhij\u00e4rvi, S., Ojala, M., Vuokko, N., Puolam\u00e4ki, K., Tatti, N., Mannila, H.: Tell me something I don\u2019t know: randomization strategies for iterative data mining. In: Proc. KDD 2009, pp. 379\u2013388 (2009)","DOI":"10.1145\/1557019.1557065"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Hollm\u00e9n, J., Sepp\u00e4nen, J.K., Mannila, H.: Mixture models and frequent sets: combining global and local methods for 0-1 data. In: Proc. SDM 2003 (2003)","DOI":"10.1137\/1.9781611972733.32"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Mampaey, M., Tatti, N., Vreeken, J.: Tell me what I need to know: succinctly summarizing data with itemsets. In: Proc. KDD 2011 (2011)","DOI":"10.1145\/2020408.2020499"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-15883-4_21","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M. Mampaey","year":"2010","unstructured":"Mampaey, M., Vreeken, J.: Summarising data by clustering items. In: Balc\u00e1zar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010. LNCS, vol.\u00a06322, pp. 321\u2013336. Springer, Heidelberg (2010)"},{"issue":"10","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TKDE.2008.53","volume":"20","author":"P. Miettinen","year":"2008","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The discrete basis problem. IEEE Trans. Knowl. Data Eng.\u00a020(10), 1348\u20131362 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"26_CR15","volume-title":"The Atlas of European Mammals","author":"A.J. Mitchell-Jones","year":"1999","unstructured":"Mitchell-Jones, A.J., Amori, G., Bogdanowicz, W., Krystufek, B., Reijnders, P.J.H., Spitzenberger, F., Stubbe, M., Thissen, J.B.M., Vohralik, V., Zima, J.: The Atlas of European Mammals. Academic Press, London (1999)"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"M\u00fcller, E., G\u00fcnnemann, S., Assent, I., Seidl, T.: Evaluating clustering in subspace projections of high dimensional data. In: Proc. VLDB 2009 (2009)","DOI":"10.14778\/1687627.1687770"},{"issue":"55","key":"26_CR17","doi-asserted-by":"publisher","first-page":"7324","DOI":"10.1038\/sj.onc.1209717","volume":"25","author":"S. Myllykangas","year":"2006","unstructured":"Myllykangas, S., Himberg, J., B\u00f6hling, T., Nagy, B., Hollm\u00e9n, J., Knuutila, S.: DNA copy number amplification profiling of human neoplasms. Oncogene\u00a025(55), 7324\u20137332 (2006)","journal-title":"Oncogene"},{"key":"26_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/11564126_68","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"R. Pensa","year":"2005","unstructured":"Pensa, R., Robardet, C., Boulicaut, J.-F.: A bi-clustering framework for categorical data. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 643\u2013650. Springer, Heidelberg (2005)"},{"issue":"2","key":"26_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.ipl.2008.03.013","volume":"108","author":"K. Puolam\u00e4ki","year":"2008","unstructured":"Puolam\u00e4ki, K., Hanhij\u00e4rvi, S., Garriga, G.C.: An approximation ratio for biclustering. Inf. Process. Lett.\u00a0108(2), 45\u201349 (2008)","journal-title":"Inf. Process. Lett."},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, N., Kumar, D., Mishra, B., Potts, M., Helm, R.F.: Turning cartwheels: an alternating algorithm for mining redescriptions. In: Proc. KDD 2004, pp. 266\u2013275 (2004)","DOI":"10.1145\/1014052.1014083"},{"key":"26_CR21","unstructured":"Rasch, G.: Probabilistic Models for Some Intelligence and Attainnment Tests. Danmarks paedagogiske Institut (1960)"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Tatti, N.: Computational complexity of queries based on itemsets. Inf. Process. Lett., 183\u2013187 (2006)","DOI":"10.1016\/j.ipl.2006.02.003"},{"key":"26_CR23","first-page":"131","volume":"8","author":"N. Tatti","year":"2007","unstructured":"Tatti, N.: Distances between data sets based on summary statistics. J. Mach. Learn. Res.\u00a08, 131\u2013154 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"26_CR24","unstructured":"Tatti, N., Vreeken, J.: Comparing apples and oranges - measuring differences between exploratory data mining results. Technical Report 2011\/03, University of Antwerp (2011)"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Characterising the difference. In: Proc. KDD 2007, pp. 765\u2013774 (2007)","DOI":"10.1145\/1281192.1281274"},{"issue":"1","key":"26_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J. Vreeken","year":"2010","unstructured":"Vreeken, J., van Leeuwen, M., Siebes, A.: Krimp: Mining itemsets that compress. Data Min. Knowl. Disc.\u00a023(1), 169\u2013214 (2010)","journal-title":"Data Min. Knowl. Disc."},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Wang, C., Parthasarathy, S.: Summarizing itemset patterns using probabilistic models. In: Proc. KDD 2006, pp. 730\u2013735 (2006)","DOI":"10.1145\/1150402.1150495"},{"key":"26_CR28","doi-asserted-by":"crossref","unstructured":"Xiang, Y., Jin, R., Fuhry, D., Dragan, F.: Summarizing transactional databases with overlapped hyperrectangles. Data Min. Knowl. Disc. (2010)","DOI":"10.1007\/s10618-010-0203-9"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Ramakrishnan, N.: Reasoning about sets using redescription mining. In: Proc. KDD 2005, pp. 364\u2013373 (2005)","DOI":"10.1145\/1081870.1081912"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23808-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T00:47:46Z","timestamp":1560473266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23808-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642238079","9783642238086"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23808-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}