{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:11:58Z","timestamp":1780636318204,"version":"3.54.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10618-012-0273-y","type":"journal-article","created":{"date-parts":[[2012,6,10]],"date-time":"2012-06-10T04:41:35Z","timestamp":1339303295000},"page":"208-242","source":"Crossref","is-referenced-by-count":95,"title":["Diverse subgroup set discovery"],"prefix":"10.1007","volume":"25","author":[{"given":"Matthijs","family":"van Leeuwen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arno","family":"Knobbe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,6,10]]},"reference":[{"key":"273_CR1","doi-asserted-by":"crossref","unstructured":"Abudawood T, Flach P (2009) Evaluation measures for multi-class subgroup discovery. In: Proceedings of the ECML\/PKDD\u201909, Bled, pp 35\u201350","DOI":"10.1007\/978-3-642-04180-8_20"},{"key":"273_CR2","doi-asserted-by":"crossref","unstructured":"Atzm\u00fcller M, Lemmerich F (2009) Fast subgroup discovery for continuous target concepts. In: Proceedings of ISMIS \u201909, Prague, pp 35\u201344","DOI":"10.1007\/978-3-642-04125-9_7"},{"key":"273_CR3","doi-asserted-by":"crossref","unstructured":"Aumann Y, Lindell Y (1999) A statistical theory for quantitative association rules. In: Proceedings of KDD\u201999, San Diego, pp 261\u2013270","DOI":"10.1145\/312129.312243"},{"key":"273_CR4","unstructured":"Bailey J, Dong G (2007) Contrast data mining: methods and applications. Tutorial at the IEEE international conference on data mining (ICDM), Omaha"},{"issue":"3","key":"273_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"S Bay","year":"2001","unstructured":"Bay S, Pazzani M (2001) Detecting group differences: mining contrast sets. Data Min Knowl Discov 5(3): 213\u2013246","journal-title":"Data Min Knowl Discov"},{"key":"273_CR6","doi-asserted-by":"crossref","unstructured":"Bringmann B, Zimmermann A (2007) The chosen few: on identifying valuable patterns. In: Proceedings of the ICDM\u201907, Omaha, pp 63\u201372","DOI":"10.1109\/ICDM.2007.85"},{"key":"273_CR7","doi-asserted-by":"crossref","unstructured":"Clark P, Boswell R (1991) Rule induction with CN2: some recent improvements. In: Proceedings of the European working session on learning (EWSL-91), Porto, pp 151\u2013163","DOI":"10.1007\/BFb0017011"},{"key":"273_CR8","first-page":"261","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark P, Niblett T (1989) The CN2 induction algorithm. Mach Learn 3: 261\u2013283","journal-title":"Mach Learn"},{"key":"273_CR9","volume-title":"Elements of information theory","author":"T Cover","year":"2006","unstructured":"Cover T, Thomas J (2006) Elements of information theory, 2nd ed. Wiley, New York","edition":"2"},{"key":"273_CR10","doi-asserted-by":"crossref","unstructured":"Daly O, Taniar D (2005) Exception rules in data mining. In: Encyclopedia of information science and technology (II), pp 1144\u20131148","DOI":"10.4018\/978-1-59140-553-5.ch202"},{"key":"273_CR11","doi-asserted-by":"crossref","unstructured":"Dong G, Zhang X, Wong L, Li J (1999) CAEP: classification by aggregating emerging patterns. In: Proceedings of DS\u201999, Tokyo, pp 30\u201342","DOI":"10.1007\/3-540-46846-3_4"},{"key":"273_CR12","doi-asserted-by":"crossref","unstructured":"Duivesteijn W, Knobbe A, Feelders A, van Leeuwen M (2010) Subgroup discovery meets bayesian networks: an exceptional model mining approach. In: Proceedings of the ICDM\u201910, Sydney, pp 158\u2013167","DOI":"10.1109\/ICDM.2010.53"},{"issue":"2","key":"273_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1008894516817","volume":"9","author":"J Friedman","year":"1999","unstructured":"Friedman J, Fisher N (1999) Bump hunting in high-dimensional data. Stat Comput 9(2): 123\u2013143","journal-title":"Stat Comput"},{"key":"273_CR14","first-page":"559","volume":"9","author":"G Garriga","year":"2008","unstructured":"Garriga G, Kralj P, Lavrac N (2008) Closed sets for labeled data. J Mach Learn Res 9: 559\u2013580","journal-title":"J Mach Learn Res"},{"key":"273_CR15","doi-asserted-by":"crossref","unstructured":"Grosskreutz H, Paurat D (2011) Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space. In: Proceedings of the ECML\/PKDD \u201911, Athens, pp 533\u2013548","DOI":"10.1007\/978-3-642-23780-5_44"},{"issue":"2","key":"273_CR16","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/s10618-009-0136-3","volume":"19","author":"H Grosskreutz","year":"2009","unstructured":"Grosskreutz H, R\u00fcping S (2009) On subgroup discovery in numerical domains. Data Min Knowl Discov 19(2): 210\u2013226","journal-title":"Data Min Knowl Discov"},{"key":"273_CR17","doi-asserted-by":"crossref","unstructured":"Grosskreutz H, R\u00fcping S, Wrobel S (2008) Tight optimistic estimates for fast subgroup discovery. In: Proceedings of the ECML\/PKDD\u201908, Antwerp, pp 440\u2013456","DOI":"10.1007\/978-3-540-87479-9_47"},{"key":"273_CR18","doi-asserted-by":"crossref","unstructured":"Grosskreutz H, Boley M, Krause-Traudes M (2010) Subgroup discovery for election analysis: a case study in descriptive data mining. In: Proceedings of DS\u201910, no. 6332 in LNAI. Springer, New York, pp 57\u201371","DOI":"10.1007\/978-3-642-16184-1_5"},{"key":"273_CR19","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The minimum description length principle","author":"P Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald P (2007) The minimum description length principle. MIT Press, Cambridge"},{"issue":"1","key":"273_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1): 55\u201386","journal-title":"Data Min Knowl Discov"},{"issue":"6","key":"273_CR21","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1111\/j.1365-2699.2006.01664.x","volume":"34","author":"H Heikinheimo","year":"2007","unstructured":"Heikinheimo H, Fortelius M, Eronen J, Mannila H (2007) Biogeography of european land mammals shows environmentally distinct and spatially coherent clusters. J Biogeogr 34(6): 1053\u20131064","journal-title":"J Biogeogr"},{"key":"273_CR22","unstructured":"Kl\u00f6sgen W (1996) Advances in knowledge discovery and data mining, chap Explora: a multipattern and multistrategy discovery assistant. MIT Press, Cambridge, pp 249\u2013271"},{"key":"273_CR23","doi-asserted-by":"crossref","unstructured":"Kl\u00f6sgen W (2002) Handbook of data mining and knowledge discovery, chap Subgroup discovery. Oxford University Press, Oxford","DOI":"10.1007\/978-1-4615-1149-6_8"},{"key":"273_CR24","volume-title":"Multi-relational data mining","author":"A Knobbe","year":"2006","unstructured":"Knobbe A (2006) Multi-relational data mining. IOS Press, Amsterdam"},{"key":"273_CR25","doi-asserted-by":"crossref","unstructured":"Knobbe A, Ho E (2006a) Maximally informative k-itemsets and their efficient discovery. In: Proceedings of the KDD\u201906, Philadelphia, Berlin, pp 237\u2013244","DOI":"10.1145\/1150402.1150431"},{"key":"273_CR26","doi-asserted-by":"crossref","unstructured":"Knobbe A, Ho E (2006b) Pattern teams. In: Proceedings of the ECML PKDD\u201906, Berlin, pp 577\u2013584","DOI":"10.1007\/11871637_58"},{"key":"273_CR27","unstructured":"Knobbe A, Valkonet J (2009) Building classifiers from pattern teams. In: Proceedings of the ECML PKDD\u201909 workshop LeGo 2009, Bled, pp 77\u201393"},{"key":"273_CR28","doi-asserted-by":"crossref","unstructured":"Kocev D, Struyf J, Dzeroski S (2007) Beam search induction and similarity constraints for predictive clustering trees. In: LNCS KDID 2006, Berlin, pp 134\u2013151","DOI":"10.1007\/978-3-540-75549-4_9"},{"key":"273_CR29","first-page":"377","volume":"10","author":"P Kralj Novak","year":"2009","unstructured":"Kralj Novak P, Lavra\u010d N, Webb G (2009) Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining. J Mach Learn Res 10: 377\u2013403","journal-title":"J Mach Learn Res"},{"issue":"1","key":"273_CR30","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler R (1951) On information and sufficiency. Ann Math Stat 22(1): 79\u201386","journal-title":"Ann Math Stat"},{"key":"273_CR31","first-page":"153","volume":"5","author":"N Lavra\u010d","year":"2004","unstructured":"Lavra\u010d N, Kav\u0161ek B, Flach P, Todorovski L (2004) Subgroup discovery with CN2-SD. J Mach Learn Res 5: 153\u2013188","journal-title":"J Mach Learn Res"},{"key":"273_CR32","doi-asserted-by":"crossref","unstructured":"Leman D, Feelders A, Knobbe A (2008) Exceptional model mining. In: Proceedings of the ECML\/PKDD\u201908, vol 2, Antwerp, pp 1\u201316","DOI":"10.1007\/978-3-540-87481-2_1"},{"key":"273_CR33","doi-asserted-by":"crossref","unstructured":"Lemmerich F, Puppe F (2011) Local models for expectation-driven subgroup discovery. In: Proceedings of the ICDM\u201911, Vancouver","DOI":"10.1109\/ICDM.2011.94"},{"key":"273_CR34","unstructured":"Lemmerich F, Rohlfs M, Atzm\u00fcller M (2010) Fast discovery of relevant subgroup patterns. In: Proceedings of FLAIRS, Daytona Beach"},{"key":"273_CR35","doi-asserted-by":"crossref","unstructured":"Liu B, Hsu W, Ma Y (2001) Discovering the set of fundamental rule changes. In: Proceedings of KDD\u201901, San Francisco, pp 335\u2013340","DOI":"10.1145\/502512.502561"},{"key":"273_CR36","unstructured":"Lowerre B (1976) The harpy speech recognition system. PhD thesis"},{"key":"273_CR37","unstructured":"Mannila H, Toivonen H (1996) Multiple uses of frequent sets and condensed representations. In: Proceedings of the KDD\u201996, Portland, pp 189\u2013194"},{"key":"273_CR38","volume-title":"The atlas of European mammals","author":"A Mitchell-Jones","year":"1999","unstructured":"Mitchell-Jones A, Amori G, Bogdanowicz W, Krystufek B, Reijnders P, Spitzenberger F, Stubbe M, Thissen J, Vohralik V, Zima J (1999) The atlas of European mammals. Academic Press, London"},{"key":"273_CR39","doi-asserted-by":"crossref","unstructured":"Morishita S, Sese J (2000) Traversing itemset lattice with statistical metric pruning. In: Proceedings PODS, Dallas, pp 226\u2013236","DOI":"10.1145\/335168.335226"},{"key":"273_CR40","doi-asserted-by":"crossref","unstructured":"Nijssen S, Guns T, De Raedt L (2009) Correlated itemset mining in roc space: a constraint programming approach. In: Proceedings KDD\u201909, Paris, pp 647\u2013656","DOI":"10.1145\/1557019.1557092"},{"key":"273_CR41","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceedings of the ICDT\u201999, Jerusalem, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"8","key":"273_CR42","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"H Peng","year":"2005","unstructured":"Peng H, Long F, Ding C (2005) Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8): 1226\u20131238","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"273_CR43","unstructured":"Pieters B, Knobbe A, Dzeroski S (2010) Subgroup discovery in ranked data, with an application to gene set enrichment. In: Proceedings preference learning workshop (PL 2010) at ECML PKDD \u201910, Barcelona"},{"key":"273_CR44","unstructured":"Shell P, Rubio JH, Barro GQ (1994) Improving search through diversity. In: AAAI, Seattle, pp 1323\u20131328"},{"key":"273_CR45","unstructured":"Tsoumakas G, Vilcek J, Spyromitros L (2010) MULAN: a java library for multi-label learning. http:\/\/mulan.sourceforge.net\/"},{"issue":"2","key":"273_CR46","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10618-010-0187-5","volume":"21","author":"M Leeuwen van","year":"2010","unstructured":"van Leeuwen M (2010) Maximal exceptions with minimal descriptions. Data Min Knowl Discov 21(2): 259\u2013276","journal-title":"Data Min Knowl Discov"},{"key":"273_CR47","unstructured":"van Leeuwen M, Knobbe A (2011) Non-redundant subgroup discovery in large and complex data. In: Proceedings of the ECML PKDD\u201911, Bled, pp 459\u2013474"},{"issue":"1","key":"273_CR48","doi-asserted-by":"crossref","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 (2011) Krimp: mining itemsets that compress. Data Min Knowl Discov 23(1): 169\u2013214","journal-title":"Data Min Knowl Discov"},{"key":"273_CR49","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"3","author":"G Webb","year":"1995","unstructured":"Webb G (1995) Opus: an efficient admissible algorithm for unordered search. J Artif Intell Res 3: 431\u2013465","journal-title":"J Artif Intell Res"},{"key":"273_CR50","doi-asserted-by":"crossref","unstructured":"Webb G (2001) Discovering associations with numeric variables. In: Proceedings of KDD\u201901, San Francisco, pp 383\u2013388","DOI":"10.1145\/502512.502569"},{"key":"273_CR51","doi-asserted-by":"crossref","unstructured":"Webb G, Butler S, Newlands D (2003) On detecting differences between groups. In: Proceedings of KDD\u201903, Washington, pp 256\u2013265","DOI":"10.1145\/956750.956781"},{"key":"273_CR52","doi-asserted-by":"crossref","unstructured":"Wrobel S (1997) An algorithm for multi-relational discovery of subgroups. In: Proceedings of PKDD 1997. Springer, Heidelberg, pp 78\u201387","DOI":"10.1007\/3-540-63223-9_108"},{"key":"273_CR53","unstructured":"Yan X, Han J (2002) gSpan: Graph-based substructure pattern mining. In: Proceedings of the ICDM\u201902, Maebashi, pp 721\u2013724"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0273-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T13:07:47Z","timestamp":1561813667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-012-0273-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,10]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s10618-012-0273-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,10]]}}}