{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:45:01Z","timestamp":1775029501125,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041792","type":"print"},{"value":"9783642041808","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04180-8_29","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T04:11:20Z","timestamp":1251346280000},"page":"179-194","source":"Crossref","is-referenced-by-count":16,"title":["Non-redundant Subgroup Discovery Using a Closure System"],"prefix":"10.1007","author":[{"given":"Mario","family":"Boley","sequence":"first","affiliation":[]},{"given":"Henrik","family":"Grosskreutz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)"},{"key":"29_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/11871637_6","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M. Atzm\u00fcller","year":"2006","unstructured":"Atzm\u00fcller, M., Puppe, F.: SD-map \u2013 A fast algorithm for exhaustive subgroup discovery. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 6\u201317. Springer, Heidelberg (2006)"},{"key":"29_CR3","first-page":"64","volume-title":"Constraint Based Mining and Inductive Databases","author":"T. Calders","year":"2005","unstructured":"Calders, T., Rigotti, C., Boulicaut, J.f.: A survey on condensed representations for frequent sets. In: Constraint Based Mining and Inductive Databases, pp. 64\u201380. Springer, Heidelberg (2005)"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Cohen, W.W.: Fast effective rule induction. In: ICML, pp. 115\u2013123 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"29_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"29_CR7","first-page":"559","volume":"9","author":"G.C. Garriga","year":"2008","unstructured":"Garriga, G.C., Kralj, P., Lavra\u010d, N.: Closed sets for labeled data. J. Mach. Learn. Res.\u00a09, 559\u2013580 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S1042-8143(05)80025-1","volume":"3","author":"F. Gebhardt","year":"1991","unstructured":"Gebhardt, F.: Choosing among competing generalizations. Knowledge Acquisition\u00a03(4), 361\u2013380 (1991)","journal-title":"Knowledge Acquisition"},{"key":"29_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-32262-7_15","volume-title":"Formal Concept Analysis","author":"A. G\u00e9ly","year":"2005","unstructured":"G\u00e9ly, A.: A generic algorithm for generating closed sets of a binary relation. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol.\u00a03403, pp. 223\u2013234. Springer, Heidelberg (2005)"},{"key":"29_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-87479-9_47","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H. Grosskreutz","year":"2008","unstructured":"Grosskreutz, H., R\u00fcping, S., Wrobel, S.: Tight optimistic estimates for fast subgroup discovery. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol.\u00a05211, pp. 440\u2013456. Springer, Heidelberg (2008)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD Conference, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"29_CR12","first-page":"249","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"W. Kl\u00f6sgen","year":"1996","unstructured":"Kl\u00f6sgen, W.: Explora: A multipattern and multistrategy discovery assistant. In: Advances in Knowledge Discovery and Data Mining, pp. 249\u2013271. AAAI Press, Menlo Park (1996)"},{"key":"29_CR13","first-page":"153","volume":"5","author":"N. Lavrac","year":"2004","unstructured":"Lavrac, N., Kavsek, B., Flach, P., Todorovski, L.: Subgroup discovery with CN2-SD. Journal of Machine Learning Research\u00a05, 153\u2013188 (2004)","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient mining of association rules using closed itemset lattices. Inf. Syst.\u00a024(1), 25\u201346 (1999)","journal-title":"Inf. Syst."},{"issue":"2","key":"29_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/jagm.1997.0887","volume":"25","author":"P. Slav\u00edk","year":"1997","unstructured":"Slav\u00edk, P.: A tight analysis of the greedy algorithm for set cover. Journal of Algorithms\u00a025(2), 237\u2013254 (1997)","journal-title":"Journal of Algorithms"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Discovery Science, pp. 16\u201331 (2004)","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-63223-9_108","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S. Wrobel","year":"1997","unstructured":"Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 1997. LNCS, vol.\u00a01263, pp. 78\u201387. Springer, Heidelberg (1997)"}],"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-642-04180-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:24:27Z","timestamp":1558268667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04180-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041792","9783642041808"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04180-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}