{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:40:00Z","timestamp":1726083600051},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030474355"},{"type":"electronic","value":"9783030474362"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-47436-2_9","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T03:02:47Z","timestamp":1588906967000},"page":"112-124","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Subgroup Discovery in Purely Numerical Data"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Millot","sequence":"first","affiliation":[]},{"given":"R\u00e9my","family":"Cazabet","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science (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 Atzmueller","year":"2006","unstructured":"Atzmueller, 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. 4213, pp. 6\u201317. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11871637_6"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Lindell, Y.: A statistical theory for quantitative association rules. In: Proceedings ACM SIGKDD, pp. 261\u2013270 (1999)","DOI":"10.1145\/312129.312243"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-10928-8_30","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"A Belfodil","year":"2019","unstructured":"Belfodil, A., Belfodil, A., Kaytoue, M.: Anytime subgroup discovery in numerical domains with guarantees. In: Berlingerio, M., Bonchi, F., G\u00e4rtner, T., Hurley, N., Ifrim, G. (eds.) ECML PKDD 2018. LNCS (LNAI), vol. 11052, pp. 500\u2013516. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-10928-8_30"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-04180-8_29","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Boley","year":"2009","unstructured":"Boley, M., Grosskreutz, H.: Non-redundant subgroup discovery using a closure system. In: Buntine, W., Grobelnik, M., Mladeni\u0107, D., Shawe-Taylor, J. (eds.) ECML PKDD 2009. LNCS (LNAI), vol. 5781, pp. 179\u2013194. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04180-8_29"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/s10618-017-0547-5","volume":"32","author":"G Bosc","year":"2017","unstructured":"Bosc, G., Boulicaut, J.F., Ra\u00efssi, C., Kaytoue, M.: Anytime discovery of a diverse set of patterns with Monte Carlo tree search. Data Min. Knowl. Discov. 32, 604\u2013650 (2017). \nhttps:\/\/doi.org\/10.1007\/s10618-017-0547-5","journal-title":"Data Min. Knowl. Discov."},{"key":"9_CR6","unstructured":"Fayyad, U.M., Irani, K.B.: Multi-interval discretization of continuous-valued attributes for classification learning. In: Proceedings of the IJCAI, pp. 1022\u20131029 (1993)"},{"key":"9_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1998","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Cham (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/TKDE.2012.35","volume":"25","author":"S Garcia","year":"2013","unstructured":"Garcia, S., Luengo, J., Saez, J.A., Lopez, V., Herrera, F.: A survey of discretization techniques: taxonomy and empirical analysis in supervised learning. IEEE Trans. Knowl. Data Eng. 25(4), 734\u2013750 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR9","first-page":"559","volume":"9","author":"GC Garriga","year":"2008","unstructured":"Garriga, G.C., Kralj, P., Lavra\u010d, N.: Closed sets for labeled data. J. Mach. Learn. Res. 9, 559\u2013580 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-23780-5_44","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H Grosskreutz","year":"2011","unstructured":"Grosskreutz, H., Paurat, D.: Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), vol. 6911, pp. 533\u2013548. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-23780-5_44"},{"issue":"2","key":"9_CR11","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.: On subgroup discovery in numerical domains. Data Min. Knowl. Discov. 19(2), 210\u2013226 (2009). \nhttps:\/\/doi.org\/10.1007\/s10618-009-0136-3","journal-title":"Data Min. Knowl. Discov."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science (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. LNCS (LNAI), vol. 5211, pp. 440\u2013456. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87479-9_47"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kaytoue, M., Kuznetsov, S.O., Napoli, A.: Revisiting numerical pattern mining with formal concept analysis. In: Proceedings of the IJCAI, pp. 1342\u20131347 (2011)","DOI":"10.1007\/978-3-642-20514-9_12"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Kl\u00f6sgen, W.: Explora: a multipattern and multistrategy discovery assistant. In: Advances in Knowledge Discovery and Data Mining, pp. 249\u2013271 (1996)","DOI":"10.1007\/3-540-61286-6_186"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10618-015-0436-8","volume":"30","author":"F Lemmerich","year":"2015","unstructured":"Lemmerich, F., Atzmueller, M., Puppe, F.: Fast exhaustive subgroup discovery with numerical target concepts. Data Min. Knowl. Disc. 30(3), 711\u2013762 (2015). \nhttps:\/\/doi.org\/10.1007\/s10618-015-0436-8","journal-title":"Data Min. Knowl. Disc."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Mampaey, M., Nijssen, S., Feelders, A., Knobbe, A.: Efficient algorithms for finding richer subgroup descriptions in numeric and nominal data. In: Proceedings of the IEEE ICDM, pp. 499\u2013508 (2012)","DOI":"10.1109\/ICDM.2012.117"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Millot, A., Mathonat, R., Cazabet, R., Boulicaut, J.F.: Actionable subgroup discovery and urban farm optimization. In: Proceedings of the IDA, p. 12 (2020, in Press)","DOI":"10.1007\/978-3-030-44584-3_27"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-03070-3_4","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"K Moreland","year":"2009","unstructured":"Moreland, K., Truemper, K.: Discretization of target attributes for subgroup discovery. In: Perner, P. (ed.) MLDM 2009. LNCS (LNAI), vol. 5632, pp. 44\u201352. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03070-3_4"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, H.V., Vreeken, J.: Flexibly mining better subgroups. In: Proceedings SIAM SDM, pp. 585\u2013593 (2016)","DOI":"10.1137\/1.9781611974348.66"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-24775-3_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A Soulet","year":"2004","unstructured":"Soulet, A., Cr\u00e9milleux, B., Rioult, F.: Condensed representation of emerging patterns. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 127\u2013132. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24775-3_16"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Webb, G.I.: Discovering associations with numeric variables. In: Proceedings of the ACM SIGKDD, pp. 383\u2013388 (2001)","DOI":"10.1145\/502512.502569"},{"key":"9_CR22","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., Zytkow, J. (eds.) PKDD 1997. LNCS, vol. 1263, pp. 78\u201387. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-63223-9_108"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47436-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T04:04:42Z","timestamp":1588910682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47436-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474355","9783030474362"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47436-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"135","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6-8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}