{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T10:13:07Z","timestamp":1778407987679,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001717","name":"Leiden University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001717","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Subgroup discovery (SD) is an exploratory pattern mining paradigm that comes into its own when dealing with large real-world data, which typically involves many attributes, of a mixture of data types. Essential is the ability to deal with numeric attributes, whether they concern the target (a regression setting) or the description attributes (by which subgroups are identified). Various specific algorithms have been proposed in the literature for both cases, but a systematic review of the available options is missing. This paper presents a generic framework that can be instantiated in various ways in order to create different strategies for dealing with numeric data. The bulk of the work in this paper describes an experimental comparison of a considerable range of numeric strategies in SD, where these strategies are organised according to four central dimensions. These experiments are furthermore repeated for both the classification task (target is nominal) and regression task (target is numeric), and the strategies are compared based on the quality of the top subgroup, and the quality and redundancy of the top-<jats:italic>k<\/jats:italic> result set. Results of three search strategies are compared: traditional beam search, complete search, and a variant of diverse subgroup set discovery called cover-based subgroup selection. Although there are various subtleties in the outcome of the experiments, the following general conclusions can be drawn: it is often best to determine numeric thresholds dynamically (locally), in a fine-grained manner, with binary splits, while considering multiple candidate thresholds per attribute.\n<\/jats:p>","DOI":"10.1007\/s10618-020-00703-x","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T18:03:13Z","timestamp":1600711393000},"page":"158-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["For real: a thorough look at numeric attributes in subgroup discovery"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6996-0478","authenticated-orcid":false,"given":"Marvin","family":"Meeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0335-5099","authenticated-orcid":false,"given":"Arno","family":"Knobbe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"issue":"1","key":"703_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/widm.1144","volume":"5","author":"M Atzm\u00fcller","year":"2015","unstructured":"Atzm\u00fcller M (2015) Subgroup discovery. Wiley Interdiscip Rev Data Min Knowl Discov 5(1):35\u201349. https:\/\/doi.org\/10.1002\/widm.1144","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"703_CR2","doi-asserted-by":"publisher","unstructured":"Atzm\u00fcller M, Lemmerich F (2009) Fast subgroup discovery for continuous target concepts. In: Rauch J, Ra\u015b ZW, Berka P, Elomaa T (eds) ISMIS 2009, International symposium on methodologies for intelligent systems, Prague, Czech Republic, 14\u201317 September, 2009, Proceedings, LNCS, vol 5722. Springer, Berlin, pp 35\u201344. https:\/\/doi.org\/10.1007\/978-3-642-04125-9_7","DOI":"10.1007\/978-3-642-04125-9_7"},{"key":"703_CR3","doi-asserted-by":"publisher","unstructured":"Atzm\u00fcller M, Puppe F (2006) SD-map\u2014a fast algorithm for exhaustive subgroup discovery. In: F\u00fcrnkranz J, Scheffer T, Spiliopoulou M (eds) PKDD 2006, European conference on principles and practice of knowledge discovery in databases, 18\u201322 Sept 2006, Proceedings, LNCS, vol 4213. Springer, Berlin, pp 6\u201317. https:\/\/doi.org\/10.1007\/11871637_6","DOI":"10.1007\/11871637_6"},{"key":"703_CR4","doi-asserted-by":"publisher","unstructured":"Belfodil A [Aimene], Belfodil A, Kaytoue M (2018) Anytime subgroup discovery in numerical domains with guarantees. In: Berlingerio M, Bonchi F, G\u00e4rtner T, Hurley N, Ifrim G (eds) ECML PKDD 2018, European conference on machine learning and principles and practice of knowledge discovery in databases, Dublin, Ireland, 10\u201314 Sept 2018, proceedings, part II, LNCS, vol 11052. Springer, Cham, pp 500\u2013516. https:\/\/doi.org\/10.1007\/978-3-030-10928-8_30","DOI":"10.1007\/978-3-030-10928-8_30"},{"issue":"5","key":"703_CR5","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s10618-017-0520-3","volume":"31","author":"M Boley","year":"2017","unstructured":"Boley M, Goldsmith BR, Ghiringhelli LM, Vreeken J (2017) Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery. Data Min Knowl Discov 31(5):1391\u20131418. https:\/\/doi.org\/10.1007\/s10618-017-0520-3","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"703_CR6","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/s10618-017-0547-5","volume":"32","author":"G Bosc","year":"2018","unstructured":"Bosc G, Boulicaut J, Ra\u00efssi C, Kaytoue M (2018) Anytime discovery of a diverse set of patterns with Monte Carlo tree search. Data Min Knowl Discov 32(3):604\u2013650. https:\/\/doi.org\/10.1007\/s10618-017-0547-5","journal-title":"Data Min Knowl Discov"},{"key":"703_CR7","doi-asserted-by":"publisher","unstructured":"Brin S, Motwani R, Ullman JD, Tsur S (1997) Dynamic itemset counting and implication rules for market basket data. In: Peckham JM, Ram S, Franklin M (eds) SIGMOD 1997, International conference on management of data, Tucson, Arizona, USA, 13\u201315 May 1997, Proceedings, ACM, New York, NY, pp 255\u2013264. https:\/\/doi.org\/10.1145\/253260.253325","DOI":"10.1145\/253260.253325"},{"key":"703_CR8","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"703_CR9","doi-asserted-by":"publisher","unstructured":"Dougherty J, Kohavi R, Sahami M (1995) Supervised and unsupervised discretization of continuous features. In: Prieditis A, Russell SJ (eds) ICML 1995, International conference on machine learning, Tahoe City, CA, 9\u201312 July, 1995, Proceedings. Morgan Kaufmann, San Francisco, CA, pp 194\u2013202. https:\/\/doi.org\/10.1016\/B978-1-55860-377-6.50032-3","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"703_CR10","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"703_CR11","unstructured":"Duivesteijn W (2013) Exceptional model mining. Ph.D. thesis, Leiden University, Leiden Institute of Advanced Computer Science. http:\/\/hdl.handle.net\/1887\/21760"},{"key":"703_CR12","doi-asserted-by":"publisher","unstructured":"Duivesteijn W, Meeng M (2016) SCHEP\u2014a geometric quality measure for regression rule sets, gauging ranking consistency throughout the real-valued target space. In: Michaelis S, Piatkowski N, Stolpe M (eds) Solving large scale learning tasks. Challenges and algorithms\u2014essays dedicated to Katharina Morik on the occasion of her 60th birthday, LNCS, vol 9580. Springer, pp 272\u2013285. https:\/\/doi.org\/10.1007\/978-3-319-41706-6_14","DOI":"10.1007\/978-3-319-41706-6_14"},{"key":"703_CR13","doi-asserted-by":"publisher","unstructured":"Duivesteijn W, Knobbe A, Feelders A, van Leeuwen M (2010) Subgroup discovery meets Bayesian networks\u2014an exceptional model mining approach. In: Webb GI, Liu B, Zhang C, Gunopulos D, Wu X (eds) ICDM 2010, IEEE international conference on data mining, Sydney, Australia, 14\u201317 Dec 2010, Proceedings, IEEE Computer Society, Los Alamitos, CA, pp 158\u2013167. https:\/\/doi.org\/10.1109\/ICDM.2010.53","DOI":"10.1109\/ICDM.2010.53"},{"key":"703_CR14","doi-asserted-by":"publisher","unstructured":"Duivesteijn W, Feelders A, Knobbe A (2012) Different slopes for different folks\u2014mining for exceptional regression models with Cook\u2019s distance. In: Yang Q, Agarwal D, Pei J (eds) KDD 2012, ACM SIGKDD international conference on knowledge discovery and data mining, Beijing, China, 12\u201316 Aug 2012, Proceedings, ACM, New York, NY, pp 868\u2013876. https:\/\/doi.org\/10.1145\/2339530.2339668","DOI":"10.1145\/2339530.2339668"},{"issue":"8","key":"703_CR15","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett T (2006) An introduction to ROC analysis. Pattern Recogn Lett 27(8):861\u2013874. https:\/\/doi.org\/10.1016\/j.patrec.2005.10.010","journal-title":"Pattern Recogn Lett"},{"key":"#cr-split#-703_CR16.1","unstructured":"Fayyad UM, Irani KB (1993) Multi-interval discretization of continuous-valued attributes for classification learning. In: Bajcsy R"},{"key":"#cr-split#-703_CR16.2","unstructured":"(ed) IJCAI 1993, international joint conference on artificial intelligence, Chamb\u00e9ry, France, 28 Aug-3 Sept 1993, proceedings, part II. Morgan Kaufmann, San Francisco, CA, pp 1022-1029. http:\/\/ijcai.org\/Proceedings\/93-2\/Papers\/022.pdf"},{"key":"703_CR17","unstructured":"Frank E, Witten IH (1999) Making better use of global discretization. In: Bratko I, D\u017eeroski S (eds) ICML 1999, International Conference on Machine Learning, Bled, Slovenia, 27\u201330 June, 1999, Proceedings, Morgan Kaufmann, San Francisco, CA, USA, pp 115\u2013123, https:\/\/hdl.handle.net\/10289\/1507"},{"issue":"1","key":"703_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10994-005-5011-x","volume":"58","author":"J F\u00fcrnkranz","year":"2005","unstructured":"F\u00fcrnkranz J, Flach PA (2005) ROC \u2018n\u2019 Rule learning\u2014towards a better understanding of covering algorithms. Mach Learn 58(1):39\u201377. https:\/\/doi.org\/10.1007\/s10994-005-5011-x","journal-title":"Mach Learn"},{"key":"703_CR19","series-title":"Springer briefs in computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72889-6","volume-title":"Redescription mining","author":"E Galbrun","year":"2017","unstructured":"Galbrun E, Miettinen P (2017) Redescription mining. Springer briefs in computer science. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-319-72889-6"},{"issue":"2","key":"703_CR20","doi-asserted-by":"publisher","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 Disco 19(2):210\u2013226. https:\/\/doi.org\/10.1007\/s10618-009-0136-3","journal-title":"Data Min Knowl Disco"},{"key":"703_CR21","doi-asserted-by":"publisher","unstructured":"Grosskreutz H, R\u00fcping S, Wrobel S (2008) Tight optimistic estimates for fast subgroup discovery. In: Daelemans W, Goethals B, Morik K (eds) ECML PKDD 2008, European conference on machine learning and principles and practice of knowledge discovery in databases, Antwerp, Belgium, 15\u201319 Sept 2008, proceedings, part I, LNCS, vol 5211. Springer, Berlin, pp 440\u2013456. https:\/\/doi.org\/10.1007\/978-3-540-87479-9_47","DOI":"10.1007\/978-3-540-87479-9_47"},{"key":"703_CR22","doi-asserted-by":"publisher","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Chen W, Naughton JF, Bernstein PA (eds) SIGMOD 2000, international conference on management of data, Dallas, TX, 16\u201318 May 2000, proceedings, ACM, New York, NY, pp 1\u201312. https:\/\/doi.org\/10.1145\/342009.335372","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"703_CR23","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10115-010-0356-2","volume":"29","author":"F Herrera","year":"2011","unstructured":"Herrera F, Carmona CJ, Gonz\u00e1lez P, del Jes\u00fas MJ (2011) An overview on subgroup discovery: foundations and applications. Knowl Inf Syst 29(3):495\u2013525. https:\/\/doi.org\/10.1007\/s10115-010-0356-2","journal-title":"Knowl Inf Syst"},{"key":"703_CR24","unstructured":"Ioannidis YE (2003) The history of histograms (abridged). In: Freytag JC, Lockemann PC, Abiteboul S, Carey MJ, Selinger PG, Heuer A (eds) VLDB 2003, international conference on very large data bases, Berlin, Germany, 9\u201312 Sept 2003, proceedings. Morgan Kaufmann, San Francisco, CA. http:\/\/www.vldb.org\/conf\/2003\/papers\/S02P01.pdf"},{"issue":"7","key":"703_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1080\/08839510600779688","volume":"20","author":"B Kav\u0161ek","year":"2006","unstructured":"Kav\u0161ek B, Lavra\u010d N (2006) APRIORI-SD: adapting association rule learning to subgroup discovery. Appl Artif Intell 20(7):543\u2013583. https:\/\/doi.org\/10.1080\/08839510600779688","journal-title":"Appl Artif Intell"},{"key":"703_CR26","doi-asserted-by":"publisher","unstructured":"Kaytoue M, Kuznetsov SO, Napoli A (2011) Revisiting numerical pattern mining with formal concept analysis. In: Walsh T (ed) IJCAI 2011, international joint conference on artificial intelligence, Barcelona, Catalonia, Spain, 16\u201322 July 2011, proceedings, IJCAI\/AAAI, pp 1342\u20131347. https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-227","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-227"},{"issue":"7","key":"703_CR27","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1002\/int.4550070707","volume":"7","author":"W Kl\u00f6sgen","year":"1992","unstructured":"Kl\u00f6sgen W (1992) Problems for knowledge discovery in databases and their treatment in the statistics interpreter EXPLORA. Int J Intell Syst 7(7):649\u2013673. https:\/\/doi.org\/10.1002\/int.4550070707","journal-title":"Int J Intell Syst"},{"key":"703_CR28","first-page":"249","volume-title":"Advances in knowledge discovery and data mining","author":"W Kl\u00f6sgen","year":"1996","unstructured":"Kl\u00f6sgen W (1996) EXPLORA: a multipattern and multistrategy discovery assistant. In: Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (eds) Advances in knowledge discovery and data mining. American Association for Artificial Intelligence (AAAI\/MIT Press), Menlo Park, pp 249\u2013271"},{"key":"703_CR29","doi-asserted-by":"publisher","unstructured":"Kl\u00f6sgen W (1999) Applications and research problems of subgroup mining. In: Ra\u015b ZW, Skowron A (eds) ISMIS 1999, international symposium on methodologies for intelligent systems, Warsaw, Poland, 8\u201311 June 1999, proceedings, LNCS, vol 1609. Springer, Berlin, pp 1\u201315. https:\/\/doi.org\/10.1007\/BFb0095086","DOI":"10.1007\/BFb0095086"},{"key":"703_CR30","doi-asserted-by":"publisher","unstructured":"Knobbe A, Ho EKY (2006a) Maximally informative $$k$$-itemsets and their efficient discovery. In: Eliassi-Rad T, Ungar LH, Craven M, Gunopulos D (eds) KDD 2006, ACM SIGKDD international conference on knowledge discovery and data mining, Philadelphia, PA, USA, 20\u201323 Aug 2006, proceedings. ACM, New York, NY, pp 237\u2013244. https:\/\/doi.org\/10.1145\/1150402.1150431","DOI":"10.1145\/1150402.1150431"},{"key":"703_CR31","doi-asserted-by":"publisher","unstructured":"Knobbe A, Ho EKY (2006b) Pattern teams. In: F\u00fcrnkranz J, Scheffer T, Spiliopoulou M (eds) PKDD 2006, european conference on principles and practice of knowledge discovery in databases, Berlin, Germany, 18\u201322 Sept 2006, proceedings, LNCS, vol 4213. Springer, pp 577\u2013584. https:\/\/doi.org\/10.1007\/11871637_58","DOI":"10.1007\/11871637_58"},{"key":"703_CR32","doi-asserted-by":"publisher","unstructured":"Konijn RM, Duivesteijn W, Kowalczyk W, Knobbe A (2013) Discovering local subgroups, with an application to fraud detection. In: Pei J, Tseng VS, Cao L, Motoda H, Xu G (eds) PAKDD 2013, Pacific-Asia conference on knowledge discovery and data mining, Gold Coast, Australia, 14\u201317 Apr 2013, proceedings, part I, LNCS, vol 7818. Springer, Berlin, pp 1\u201312. https:\/\/doi.org\/10.1007\/978-3-642-37453-1_1","DOI":"10.1007\/978-3-642-37453-1_1"},{"issue":"3","key":"703_CR33","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10844-014-0313-8","volume":"45","author":"RM Konijn","year":"2015","unstructured":"Konijn RM, Duivesteijn W, Meeng M, Knobbe A (2015) Cost-based quality measures in subgroup discovery. J Intell Inf Syst 45(3):337\u2013355. https:\/\/doi.org\/10.1007\/s10844-014-0313-8","journal-title":"J Intell Inf Syst"},{"key":"703_CR34","unstructured":"Kontkanen P, Myllym\u00e4ki P (2007) MDL histogram density estimation. In: Meila M, Shen X (eds) AISTATS 2007, international conference on artificial intelligence and statistics, San Juan, Puerto Rico, 21\u201324 March 2007, Proceedings, Part II, PMLR. Proceedings of Machine Learning Research, pp 219\u2013226. http:\/\/proceedings.mlr.press\/v2\/kontkanen07a\/kontkanen07a.pdf"},{"key":"703_CR35","doi-asserted-by":"publisher","unstructured":"Lavra\u010d N, Gamberger D (2004) Relevancy in constraint-based subgroup discovery. In: Boulicaut J, Raedt LD, Mannila H (eds) Constraint-based mining and inductive databases, European workshop on inductive databases and constraint based mining, Hinterzarten, Germany, 11\u201313 March 2004, Revised Selected Papers, LNCS, vol 3848. Springer, Berlin, pp 243\u2013266. https:\/\/doi.org\/10.1007\/11615576_12","DOI":"10.1007\/11615576_12"},{"key":"703_CR36","doi-asserted-by":"publisher","unstructured":"Lavra\u010d N, Flach PA, Zupan B (1999) Rule evaluation measures: a unifying view. In: D\u017eeroski S, Flach PA (eds) ILP-99, inductive logic programming, Bled, Slovenia, 24\u201327 June 1999, Proceedings, LNCS, vol 1634. Springer, Berlin, pp 174\u2013185. https:\/\/doi.org\/10.1007\/3-540-48751-4_17","DOI":"10.1007\/3-540-48751-4_17"},{"key":"703_CR37","first-page":"153","volume":"5","author":"N Lavra\u010d","year":"2004","unstructured":"Lavra\u010d N, Kav\u0161ek B, Flach PA, Todorovski L (2004) Subgroup discovery with CN2-SD. J Mach Learn Res 5:153\u2013188","journal-title":"J Mach Learn Res"},{"key":"703_CR38","doi-asserted-by":"publisher","unstructured":"Lemmerich F, Becker M, Atzm\u00fcller M (2012) Generic pattern trees for exhaustive exceptional model mining. In: Flach PA, De Bie T, Cristianini N (eds) ECML PKDD 2012, European conference on machine learning and principles and practice of knowledge discovery in databases, Bristol, UK, 24\u201328 Sept 2012, proceedings, part II, LNCS, vol 7524. Springer, Berlin, pp 277\u2013292. https:\/\/doi.org\/10.1007\/978-3-642-33486-3_18","DOI":"10.1007\/978-3-642-33486-3_18"},{"key":"703_CR39","doi-asserted-by":"publisher","unstructured":"Lemmerich F, Becker M, Puppe F (2013) Difference-based estimates for generalization-aware subgroup discovery. In: Blockeel H, Kersting K, Nijssen S, \u017delezn\u00fd F (eds) ECML PKDD 2013, European conference on machine learning and principles and practice of knowledge discovery in databases, Prague, Czech Republic, 23\u201327 Sept 2013, proceedings, part III, LNCS, vol 8190. Springer, Berlin, pp 288\u2013303. https:\/\/doi.org\/10.1007\/978-3-642-40994-3_19","DOI":"10.1007\/978-3-642-40994-3_19"},{"issue":"3","key":"703_CR40","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10618-015-0436-8","volume":"30","author":"F Lemmerich","year":"2016","unstructured":"Lemmerich F, Atzm\u00fcller M, Puppe F (2016) Fast exhaustive subgroup discovery with numerical target concepts. Data Min Knowl Discov 30(3):711\u2013762. https:\/\/doi.org\/10.1007\/s10618-015-0436-8","journal-title":"Data Min Knowl Discov"},{"key":"703_CR41","unstructured":"Lowerre BT (1976) The Harpy speech recognition system. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, USA"},{"key":"703_CR42","doi-asserted-by":"publisher","unstructured":"Mampaey M, Nijssen S, Feelders A, Knobbe A (2012) Efficient algorithms for finding richer subgroup descriptions in numeric and nominal data. In: Zaki MJ, Siebes A, Yu JX, Goethals B, Webb GI, Wu X (eds) ICDM 2012, IEEE international conference on data mining, Brussels, Belgium, 10\u201313 Dec 2012, proceedings. IEEE Computer Society, Los Alamitos, CA, USA, pp 499\u2013508. https:\/\/doi.org\/10.1109\/ICDM.2012.117","DOI":"10.1109\/ICDM.2012.117"},{"issue":"2","key":"703_CR43","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10115-013-0714-y","volume":"42","author":"M Mampaey","year":"2015","unstructured":"Mampaey M, Nijssen S, Feelders A, Konijn RM, Knobbe A (2015) Efficient algorithms for finding optimal binary features in numeric and nominal labeled data. Knowl Inf Syst 42(2):465\u2013492. https:\/\/doi.org\/10.1007\/s10115-013-0714-y","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"703_CR44","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"Mann HB, Whitney DR (1947) On a test of whether one of two random variables is stochastically larger than the other. Ann Math Stat 18(1):50\u201360. https:\/\/doi.org\/10.1214\/aoms\/1177730491","journal-title":"Ann Math Stat"},{"key":"703_CR45","unstructured":"Meeng M, Knobbe A (2011) Flexible enrichment with Cortana\u2014software demo. In: van\u00a0der Putten P, Veenman C, Vanschoren J, Israel M, Blockeel H (eds) Benelearn 2011, Belgian Dutch conference on machine learning, The Hague, the Netherlands, 20 May 2011, proceedings, pp 117\u2013119"},{"key":"703_CR46","doi-asserted-by":"crossref","unstructured":"Meeng M, Knobbe A (2020) Uni- and multivariate probability density models for numeric subgroup discovery. Intell Data Anal 24(6)","DOI":"10.3233\/IDA-194719"},{"key":"703_CR47","doi-asserted-by":"publisher","unstructured":"Meeng M, Duivesteijn W, Knobbe A (2014) ROCsearch\u2014an ROC-guided search strategy for subgroup discovery. In: Zaki MJ, Obradovic Z, Tan P, Banerjee A, Kamath C, Parthasarathy S (eds) SDM 2014, international conference on data mining, Philadelphia, PA, USA, 24\u201326 April 2014, proceedings. SIAM, pp 704\u2013712. https:\/\/doi.org\/10.1137\/1.9781611973440.81","DOI":"10.1137\/1.9781611973440.81"},{"issue":"5\u20136","key":"703_CR48","doi-asserted-by":"publisher","first-page":"1366","DOI":"10.1007\/s10618-014-0350-5","volume":"28","author":"H Nguyen","year":"2014","unstructured":"Nguyen H, M\u00fcller E, Vreeken J, B\u00f6hm K (2014) Unsupervised interaction-preserving discretization of multivariate data. Data Min Knowl Discov 28(5\u20136):1366\u20131397. https:\/\/doi.org\/10.1007\/s10618-014-0350-5","journal-title":"Data Min Knowl Discov"},{"key":"703_CR49","unstructured":"Pieters BFI, Knobbe A, D\u017eeroski S (2010) Subgroup discovery in ranked data, with an application to gene set enrichment. In: PL-10, preference learning workshop at ECML PKDD 2010, European conference on machine learning and principles and practice of knowledge discovery in databases, Barcelona, Spain, 20\u201324 Sept 2010. http:\/\/www.ke.tu-darmstadt.de\/events\/PL-10\/papers\/7-Pieters.pdf"},{"key":"703_CR50","doi-asserted-by":"publisher","unstructured":"van Leeuwen M, Knobbe A (2011) Non-redundant subgroup discovery in large and complex data. In: Gunopulos D, Hofmann T, Malerba D, Vazirgiannis M (eds) ECML PKDD 2011, European conference on machine learning and principles and practice of knowledge discovery in databases, Athens, Greece, 5\u20139 Sept 2011, proceedings, part III, LNCS, vol 6913. Springer, Berlin, pp 459\u2013474. https:\/\/doi.org\/10.1007\/978-3-642-23808-6_30","DOI":"10.1007\/978-3-642-23808-6_30"},{"issue":"2","key":"703_CR51","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/s10618-012-0273-y","volume":"25","author":"M van Leeuwen","year":"2012","unstructured":"van Leeuwen M, Knobbe A (2012) Diverse subgroup set discovery. Data Min Knowl Disco 25(2):208\u2013242. https:\/\/doi.org\/10.1007\/s10618-012-0273-y","journal-title":"Data Min Knowl Disco"},{"key":"703_CR52","doi-asserted-by":"publisher","unstructured":"Wrobel S (1997) An algorithm for multi-relational discovery of subgroups. In: Komorowski HJ, Zytkow JM (eds) PKDD 1997, principles of data mining and knowledge discovery, first European symposium, Trondheim, Norway, 24\u201327 June 1997, proceedings, LNCS, vol 1263. Springer, pp 78\u201387. https:\/\/doi.org\/10.1007\/3-540-63223-9_108","DOI":"10.1007\/3-540-63223-9_108"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00703-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-020-00703-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-020-00703-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T00:57:51Z","timestamp":1632185871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-020-00703-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,21]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["703"],"URL":"https:\/\/doi.org\/10.1007\/s10618-020-00703-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,21]]},"assertion":[{"value":"28 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}