{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T01:41:02Z","timestamp":1776217262329,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Max Planck Institute for Informatics"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10618-017-0520-3","type":"journal-article","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T05:28:46Z","timestamp":1498627726000},"page":"1391-1418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0704-4968","authenticated-orcid":false,"given":"Mario","family":"Boley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1264-8018","authenticated-orcid":false,"given":"Bryan R.","family":"Goldsmith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca M.","family":"Ghiringhelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2310-2806","authenticated-orcid":false,"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"issue":"2\u20133","key":"520_CR1","first-page":"255","volume":"17","author":"J Alcal\u00e1","year":"2010","unstructured":"Alcal\u00e1 J, Fern\u00e1ndez A, Luengo J, Derrac J, Garc\u00eda S, S\u00e1nchez L, Herrera F (2010) Keel data-mining software tool: data set repository, integration of algorithms and experimental analysis framework. J Mult Valued Log Soft Comput 17(2\u20133):255\u2013287","journal-title":"J Mult Valued Log Soft Comput"},{"issue":"1","key":"520_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/widm.1144","volume":"5","author":"M Atzmueller","year":"2015","unstructured":"Atzmueller M (2015) Subgroup discovery. Wiley Interdiscip Rev Data Min Knowl Discov 5(1):35\u201349","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"issue":"3","key":"520_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1022812808206","volume":"20","author":"Y Aumann","year":"2003","unstructured":"Aumann Y, Lindell Y (2003) A statistical theory for quantitative association rules. J Intell Inf Syst 20(3):255\u2013283","journal-title":"J Intell Inf Syst"},{"issue":"3","key":"520_CR4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"SD Bay","year":"2001","unstructured":"Bay SD, Pazzani MJ (2001) Detecting group differences: mining contrast sets. Data Min Knowl Discov 5(3):213\u2013246","journal-title":"Data Min Knowl Discov"},{"key":"520_CR5","unstructured":"Benavoli A, Corani G, Mangili F, Zaffalon M, Ruggeri F (2014) A Bayesian Wilcoxon signed-rank test based on the Dirichlet process. In: ICML. pp 1026\u20131034"},{"key":"520_CR6","unstructured":"Benavoli A, Corani G, Demsar J, Zaffalon M (2016) Time for a change: a tutorial for comparing multiple classifiers through Bayesian analysis. arXiv:1606.04316"},{"key":"520_CR7","doi-asserted-by":"crossref","unstructured":"Boley M, Grosskreutz H (2009) Non-redundant subgroup discovery using a closure system. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 179\u2013194","DOI":"10.1007\/978-3-642-04180-8_29"},{"key":"520_CR8","doi-asserted-by":"crossref","unstructured":"Boley M, Moens S, G\u00e4rtner T (2012) Linear space direct pattern sampling using coupling from the past. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 69\u201377","DOI":"10.1145\/2339530.2339545"},{"key":"520_CR9","unstructured":"Dem\u0161ar J (2008) On the appropriateness of statistical tests in machine learning. In: Workshop on evaluation methods for machine learning in conjunction with ICML"},{"key":"520_CR10","doi-asserted-by":"crossref","unstructured":"Duivesteijn W, Knobbe A (2011) Exploiting false discoveries-statistical validation of patterns and quality measures in subgroup discovery. IEEE 11th international conference on data mining. IEEE, pp 151\u2013160","DOI":"10.1109\/ICDM.2011.65"},{"issue":"1","key":"520_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10618-015-0403-4","volume":"30","author":"W Duivesteijn","year":"2016","unstructured":"Duivesteijn W, Feelders AJ, Knobbe A (2016) Exceptional model mining. Data Min Knowl Discov 30(1):47\u201398","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"520_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1008894516817","volume":"9","author":"JH Friedman","year":"1999","unstructured":"Friedman JH, Fisher NI (1999) Bump hunting in high-dimensional data. Stat Comput 9(2):123\u2013143","journal-title":"Stat Comput"},{"issue":"1","key":"520_CR13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1088\/1367-2630\/aa57c2","volume":"19","author":"BR Goldsmith","year":"2017","unstructured":"Goldsmith BR, Boley M, Vreeken J, Scheffler M, Ghiringhelli LM (2017) Uncovering structure-property relationships of materials by subgroup discovery. New J Phys 19(1):13\u201331","journal-title":"New J Phys"},{"key":"520_CR14","doi-asserted-by":"crossref","unstructured":"Grosskreutz H, R\u00fcping S, Wrobel S (2008) Tight optimistic estimates for fast subgroup discovery. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 440\u2013456","DOI":"10.1007\/978-3-540-87479-9_47"},{"key":"520_CR15","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: International conference on discovery science. Springer, pp 57\u201371","DOI":"10.1007\/978-3-642-16184-1_5"},{"key":"520_CR16","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: 3rd IEEE international conference on data mining. IEEE, pp 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"2","key":"520_CR17","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s11222-011-9229-0","volume":"22","author":"A Kab\u00e1n","year":"2012","unstructured":"Kab\u00e1n A (2012) Non-parametric detection of meaningless distances in high dimensional data. Stat Comput 22(2):375\u2013385","journal-title":"Stat Comput"},{"key":"520_CR18","unstructured":"Kl\u00f6sgen W (1996) Explora: a multipattern and multistrategy discovery assistant. In: Advances in knowledge discovery and data mining. American Association for Artificial Intelligence, pp 249\u2013271"},{"key":"520_CR19","unstructured":"Kl\u00f6sgen W (2002) Data mining tasks and methods: subgroup discovery: deviation analysis. In: Handbook of data mining and knowledge discovery. Oxford University Press Inc., pp 354\u2013361"},{"key":"520_CR20","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"},{"issue":"3","key":"520_CR21","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1007\/s10618-015-0436-8","volume":"30","author":"F Lemmerich","year":"2016","unstructured":"Lemmerich F, Atzmueller M, Puppe F (2016) Fast exhaustive subgroup discovery with numerical target concepts. Data Min Knowl Discov 30(3):711\u2013762","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"520_CR22","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10618-015-0409-y","volume":"30","author":"G Li","year":"2016","unstructured":"Li G, Zaki MJ (2016) Sampling frequent and minimal boolean patterns: theory and application in classification. Data Min Knowl Discov 30(1):181\u2013225","journal-title":"Data Min Knowl Discov"},{"key":"520_CR23","volume-title":"Algorithms and data structures: the basic toolbox","author":"K Mehlhorn","year":"2008","unstructured":"Mehlhorn K, Sanders P (2008) Algorithms and data structures: the basic toolbox. Springer, Berlin"},{"key":"520_CR24","doi-asserted-by":"crossref","unstructured":"Parthasarathy S, Zaki MJ, Ogihara M, Dwarkadas S (1999) Incremental and interactive sequence mining. In: Proceedings of 8th international conference on information and knowledge management. ACM, pp 251\u2013258","DOI":"10.1145\/319950.320010"},{"issue":"1","key":"520_CR25","doi-asserted-by":"crossref","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 (1999) Efficient mining of association rules using closed itemset lattices. Inf Syst 24(1):25\u201346","journal-title":"Inf Syst"},{"key":"520_CR26","unstructured":"Pieters BF, 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, vol\u00a010. pp 1\u201318"},{"issue":"1","key":"520_CR27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10115-009-0234-y","volume":"24","author":"J Schmidt","year":"2010","unstructured":"Schmidt J, Hapfelmeier A, Mueller M, Perneczky R, Kurz A, Drzezga A, Kramer S (2010) Interpreting pet scans by structured patient data: a data mining case study in dementia research. Knowl Inf Syst 24(1):149\u2013170","journal-title":"Knowl Inf Syst"},{"key":"520_CR28","doi-asserted-by":"crossref","unstructured":"Song H, Kull M, Flach P, Kalogridis G (2016) Subgroup discovery with proper scoring rules. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, pp 492\u2013510","DOI":"10.1007\/978-3-319-46227-1_31"},{"key":"520_CR29","doi-asserted-by":"crossref","unstructured":"Uno T, Asai T, Uchida Y, Arimura H (2004) An efficient algorithm for enumerating closed patterns in transaction databases. In: International conference on discovery science. Springer, pp 16\u201331","DOI":"10.1007\/978-3-540-30214-8_2"},{"key":"520_CR30","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"3","author":"GI Webb","year":"1995","unstructured":"Webb GI (1995) Opus: an efficient admissible algorithm for unordered search. J Artif Intell Res 3:431\u2013465","journal-title":"J Artif Intell Res"},{"key":"520_CR31","doi-asserted-by":"crossref","unstructured":"Webb GI (2001) Discovering associations with numeric variables. In: Proceedings of the 7th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 383\u2013388","DOI":"10.1145\/502512.502569"},{"key":"520_CR32","doi-asserted-by":"crossref","unstructured":"Wrobel S (1997) An algorithm for multi-relational discovery of subgroups. In: European symposium on principles of data mining and knowledge discovery. Springer, pp 78\u201387","DOI":"10.1007\/3-540-63223-9_108"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-017-0520-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0520-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0520-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T04:54:47Z","timestamp":1569560087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-017-0520-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,28]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["520"],"URL":"https:\/\/doi.org\/10.1007\/s10618-017-0520-3","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,28]]}}}