{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T02:19:12Z","timestamp":1693707552504},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,29]],"date-time":"2013-12-29T00:00:00Z","timestamp":1388275200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10115-013-0714-y","type":"journal-article","created":{"date-parts":[[2013,12,28]],"date-time":"2013-12-28T07:07:07Z","timestamp":1388214427000},"page":"465-492","source":"Crossref","is-referenced-by-count":5,"title":["Efficient algorithms for finding optimal binary features in numeric and nominal labeled data"],"prefix":"10.1007","volume":"42","author":[{"given":"Michael","family":"Mampaey","sequence":"first","affiliation":[]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[]},{"given":"Ad","family":"Feelders","sequence":"additional","affiliation":[]},{"given":"Rob","family":"Konijn","sequence":"additional","affiliation":[]},{"given":"Arno","family":"Knobbe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,29]]},"reference":[{"key":"714_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on management of data, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"714_CR2","doi-asserted-by":"crossref","unstructured":"Atzm\u00fcller M, Puppe F (2006) SD-Map\u2014a fast algorithm for exhaustive subgroup discovery. In: Proceedings of PKDD, pp 6\u201317","DOI":"10.1007\/11871637_6"},{"key":"714_CR3","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman J, Stone CJ, Olshen RA (1984) Classification and regression trees. Chapman & Hall\/CRC, London"},{"key":"714_CR4","doi-asserted-by":"crossref","unstructured":"Calders T, Dexters N, Gillis JJM, Goethals B (2014) Mining frequent itemsets in a stream. Inf Syst 39:233\u2013255","DOI":"10.1016\/j.is.2012.01.005"},{"issue":"4","key":"714_CR5","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/34.88569","volume":"13","author":"PA Chou","year":"1991","unstructured":"Chou PA (1991) Optimal partitioning for classification and regression trees. IEEE Trans Pattern Anal Mach Intell 13(4):340\u2013354","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"714_CR6","unstructured":"Conway JH, Guy RK (1996) Farey fractions and ford circles. The Book of Numbers, Springer, pp 152\u2013154"},{"key":"714_CR7","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1002\/jae.1094","volume":"24","author":"M Costanigro","year":"2009","unstructured":"Costanigro M, Mittelhammer RC, McCluskey JJ (2009) Estimating class-specific parametric models under class uncertainty: local polynomial regression clustering in an hedonic analysis of wine markets. J Appl Econom 24:1117\u20131135","journal-title":"J Appl Econom"},{"key":"714_CR8","unstructured":"De Cock D (2011) Ames, ia real estate data, 2011. http:\/\/www.amstat.org\/publications\/jse\/"},{"issue":"2","key":"714_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1023\/B:DAMI.0000015868.85039.e6","volume":"8","author":"T Elomaa","year":"2004","unstructured":"Elomaa T, Rousu J (2004) Efficient multisplitting revisited: optima-preserving elimination of partition candidates. Data Mining Knowl Discov 8(2):97\u2013126","journal-title":"Data Mining Knowl Discov"},{"key":"714_CR10","unstructured":"Fayyad UM, Irani KB (1993) Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of the international joint conference on artificial intelligence (IJCAI), pp 1022\u20131029"},{"key":"714_CR11","unstructured":"Frank A, Asuncion A (2010) UCI machine learning repository, http:\/\/archive.ics.uci.edu\/ml"},{"issue":"1","key":"714_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1998.1595","volume":"58","author":"T Fukuda","year":"1999","unstructured":"Fukuda T, Morimoto Y, Morishita S, Tokuyama T (1999) Mining optimized association rules for numeric attributes. J Comput Syst Sci 58(1):1\u201312","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"714_CR13","doi-asserted-by":"crossref","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","journal-title":"Mach Learn"},{"issue":"4","key":"714_CR14","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inf Process Lett 1(4):132\u2013133","journal-title":"Inf Process Lett"},{"issue":"2","key":"714_CR15","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 Mining Knowl Discov 19(2):210\u2013226","journal-title":"Data Mining Knowl Discov"},{"issue":"2","key":"714_CR16","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10115-011-0432-2","volume":"32","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2012","unstructured":"H\u00e4m\u00e4l\u00e4inen W (2012) Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measures. Knowl Inf Syst 32(2):383\u2013414","journal-title":"Knowl Inf Syst"},{"key":"714_CR17","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10115-010-0356-2","volume":"29","author":"F Herrera","year":"2010","unstructured":"Herrera F, Carmona C, Gonz\u00e1lez P, del Jesus M (2010) An overview on subgroup discovery: foundations and applications. Knowl Inf Syst 29:495\u2013525","journal-title":"Knowl Inf Syst"},{"key":"714_CR18","doi-asserted-by":"crossref","unstructured":"Kav\u0161ek B, Lavra\u010d N, Jovanoski V (2003) Apriori-sd: adapting association rule learning to subgroup discovery. In Proceedings of intelligent data analysis (IDA), pp 230\u2013241","DOI":"10.1007\/978-3-540-45231-7_22"},{"key":"714_CR19","unstructured":"Kl\u00f6sgen W (2002) Handbook of data mining and knowledge discovery. Oxford University Press, New York"},{"key":"714_CR20","unstructured":"Meeng M, Knobbe A (2011) Flexible enrichment with Cortana\u2014software demo. In: Proceedings of BeneLearn, pp 117\u2013119"},{"key":"714_CR21","first-page":"377","volume":"10","author":"PK Novak","year":"2009","unstructured":"Novak PK, Lavra\u010d N, Webb GI (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":"5","key":"714_CR22","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/0022-314X(72)90038-8","volume":"4","author":"JE Nymann","year":"1972","unstructured":"Nymann JE (1972) On the probability that k positive integers are relatively prime. J Number Theory 4(5):469\u2013473","journal-title":"J Number Theory"},{"key":"714_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata FP, Shamos MI (1985) Computational geometry: an introduction. Springer, Berlin"},{"key":"714_CR24","first-page":"75","volume":"2","author":"A R\u00e9nyi","year":"1963","unstructured":"R\u00e9nyi A, Sulanke R (1963) \u00dcber die konvexe h\u00fclle von n zuf\u00e4llig gew\u00e4lten punkten. Probab Theory Relat Fields 2:75\u201384","journal-title":"Probab Theory Relat Fields"},{"issue":"2","key":"714_CR25","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10115-011-0434-0","volume":"32","author":"P Rzepakowski","year":"2012","unstructured":"Rzepakowski P, Jaroszewicz S (2012) Decision trees for uplift modeling with single and multiple treatments. Knowl Inf Syst 32(2):303\u2013327","journal-title":"Knowl Inf Syst"},{"key":"714_CR26","volume-title":"Quicksort is optimal","author":"R Sedgewick","year":"2002","unstructured":"Sedgewick R, Bentley J (2002) Quicksort is optimal. Knuthfest, Stanford University, Stanford"},{"key":"714_CR27","doi-asserted-by":"crossref","unstructured":"Wrobel S (1997) An algorithm for multi-relational discovery of subgroups. In: Proceedings of principles of data mining and knowledge discovery (PKDD), pp 78\u201387","DOI":"10.1007\/3-540-63223-9_108"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0714-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-013-0714-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-013-0714-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T11:33:06Z","timestamp":1565004786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-013-0714-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,29]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["714"],"URL":"https:\/\/doi.org\/10.1007\/s10115-013-0714-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,29]]}}}