{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:14:27Z","timestamp":1743023667823,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031236174"},{"type":"electronic","value":"9783031236181"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-23618-1_17","type":"book-chapter","created":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T07:05:49Z","timestamp":1675062349000},"page":"248-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rules, Subgroups and\u00a0Redescriptions as\u00a0Features in\u00a0Classification Tasks"],"prefix":"10.1007","author":[{"given":"Matej","family":"Mihel\u010di\u0107","sequence":"first","affiliation":[]},{"given":"Tomislav","family":"\u0160muc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,31]]},"reference":[{"issue":"10","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1093\/bioinformatics\/btq134","volume":"26","author":"A Altmann","year":"2010","unstructured":"Altmann, A., Tolo\u015fi, L., Sander, O., Lengauer, T.: Permutation importance: a corrected feature importance measure. Bioinformatics 26(10), 1340\u20131347 (2010)","journal-title":"Bioinformatics"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Arik, S.O., Pfister, T.: TabNet: attentive interpretable tabular learning. In: AAAI vol. 35, no. 8, pp. 6679\u20136687 (2021)","DOI":"10.1609\/aaai.v35i8.16826"},{"key":"17_CR3","unstructured":"Atzmueller, M., Lemmerich, F., Krause, B., Hotho, A.: Towards understanding spammers-discovering local patterns for concept description. In: LeGo ECML\/PKDD Workshop (2009)"},{"key":"17_CR4","unstructured":"Blockeel, H., Raedt, L.D., Ramon, J.: Top-down induction of clustering trees. In: ICML, pp. 55\u201363. Morgan Kaufmann (1998)"},{"key":"17_CR5","unstructured":"Dembczy\u0144ski, K., Kot\u0142owski, W., S\u0142owi\u0144ski, R.: A general framework for learning an ensemble of decision rules. In: LeGo ECML\/PKDD Workshop (2008)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"D\u00edaz-Uriarte, R., Alvarez de Andr\u00e9s, S.: Gene selection and classification of microarray data using random forest. BMC Bioinform. 7(1), 3 (2006)","DOI":"10.1186\/1471-2105-7-3"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10618-015-0403-4","volume":"30","author":"W Duivesteijn","year":"2016","unstructured":"Duivesteijn, W., Feelders, A.J., Knobbe, A.: Exceptional model mining. Data Min. Knowl. Disc. 30(1), 47\u201398 (2016)","journal-title":"Data Min. Knowl. Disc."},{"key":"17_CR8","unstructured":"Eibe, F., Hall, M.A., Witten, I.H.: The WEKA workbench. Online appendix for data mining: practical machine learning tools and techniques. In: Morgan Kaufmann. Morgan Kaufmann Publishers (2016)"},{"key":"17_CR9","series-title":"SpringerBriefs 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.: Redescription Mining. SCS, Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72889-6"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Garc\u00eda, D., Stavrakoudis, D., Gonz\u00e1lez, A., P\u00e9rez, R., Theocharis, J.B.: A fuzzy rule-based feature construction approach applied to remotely sensed imagery. In: IFSA-EUSFLAT. Atlantis Press (2015)","DOI":"10.2991\/ifsa-eusflat-15.2015.180"},{"key":"17_CR11","unstructured":"Giacometti, A., Miyaneh, E.K., Marcel, P., Soulet, A.: A generic framework for rule-based classification. In: LeGo ECML\/PKDD Workshop, pp. 37\u201354 (2008)"},{"key":"17_CR12","unstructured":"Gomez, G., Morales, E.F.: Automatic feature construction and a simple rule induction algorithm for skin detection. In: ICML Workshop on Machine Learning in Computer Vision, pp. 31\u201338 (2002)"},{"key":"17_CR13","unstructured":"Grosskreutz, H.: Cascaded subgroups discovery with an application to regression. In: ECML\/PKDD, vol. 5211, p. 33 (2008)"},{"key":"17_CR14","first-page":"1157","volume":"3","author":"I Guyon","year":"2003","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157\u20131182 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.csda.2012.09.020","volume":"60","author":"A Hapfelmeier","year":"2013","unstructured":"Hapfelmeier, A., Ulm, K.: A new variable selection approach using random forests. Comput. Stat. Data Anal. 60, 50\u201369 (2013)","journal-title":"Comput. Stat. Data Anal."},{"issue":"12","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0028210","volume":"6","author":"AC Haury","year":"2011","unstructured":"Haury, A.C., Gestraud, P., Vert, J.P.: The influence of feature selection methods on accuracy, stability and interpretability of molecular signatures. PLoS ONE 6(12), 1\u201312 (2011)","journal-title":"PLoS ONE"},{"issue":"3","key":"17_CR17","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, C.J., Gonz\u00e1lez, P., del Jesus, M.J.: An overview on subgroup discovery: foundations and applications. Knowl. Inf. Syst. 29(3), 495\u2013525 (2011)","journal-title":"Knowl. Inf. Syst."},{"issue":"4","key":"17_CR18","first-page":"271","volume":"101","author":"MB Kursa","year":"2010","unstructured":"Kursa, M.B., Jankowski, A., Rudnicki, W.R.: Boruta-a system for feature selection. Fund. Inform. 101(4), 271\u2013285 (2010)","journal-title":"Fund. Inform."},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Langley, P., Bradshaw, G.L., Simon, H.A.: Rediscovering chemistry with the bacon system. In: Michalski, R.S., Carbonell, J.G., Mitchell, T.M. (eds.) Machine Learning. Symbolic Computation, pp. 307\u2013329. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/978-3-662-12405-5_10","DOI":"10.1007\/978-3-662-12405-5_10"},{"issue":"2","key":"17_CR20","first-page":"153","volume":"5","author":"N Lavrac","year":"2004","unstructured":"Lavrac, N., Kavsek, B., Flach, P., Todorovski, L.: Subgroup discovery with CN2-SD. J. Mach. Learn. Res. 5(2), 153\u2013188 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR21","unstructured":"Liu, H., Motoda, H., Yu, L., Ye, N.: Feature Extraction, Selection, and Construction. The Handbook of Data Mining, pp. 409\u2013424 (2003)"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Liu, H., Motoda, H.: Feature Extraction, Construction and Selection: A Data Mining Perspective, vol. 453. Springer, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5725-8","DOI":"10.1007\/978-1-4615-5725-8"},{"issue":"10","key":"17_CR23","doi-asserted-by":"publisher","first-page":"3532","DOI":"10.3390\/s18103532","volume":"18","author":"N Mansbridge","year":"2018","unstructured":"Mansbridge, N.: Feature selection and comparison of machine learning algorithms in classification of grazing and rumination behaviour in sheep. Sensors 18(10), 3532 (2018)","journal-title":"Sensors"},{"issue":"1","key":"17_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1014046307775","volume":"49","author":"S Markovitch","year":"2002","unstructured":"Markovitch, S., Rosenstein, D.: Feature generation using general constructor functions. Mach. Learn. 49(1), 59\u201398 (2002)","journal-title":"Mach. Learn."},{"key":"17_CR25","unstructured":"Matheus, C.J., Rendell, L.A.: Constructive induction on decision trees. In: IJCAI - Volume 1, pp. 645\u2013650. Morgan Kaufmann Publishers Inc., San Francisco (1989)"},{"key":"17_CR26","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.eswa.2016.10.012","volume":"68","author":"M Mihel\u010di\u0107","year":"2017","unstructured":"Mihel\u010di\u0107, M., D\u017eeroski, S., Lavra\u010d, N., \u0160muc, T.: A framework for redescription set construction. Expert Syst. Appl. 68, 196\u2013215 (2017)","journal-title":"Expert Syst. Appl."},{"key":"17_CR27","unstructured":"Mozina, M., Bratko, I.: Rectifying predictions of classifiers by local rules. In: LeGo ECML\/PKDD Workshop (2008)"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Murphy, P.M., Pazzani, M.J.: ID2-of-3: constructive induction of M-of-N concepts for discriminators in decision trees. In: Machine Learning Proceedings 1991, pp. 183\u2013187. Elsevier (1991)","DOI":"10.1016\/B978-1-55860-200-7.50040-4"},{"key":"17_CR29","unstructured":"Oglic, D., G\u00e4rtner, T.: Greedy feature construction. In: NIPS, pp. 3945\u20133953. Curran Associates, Inc. (2016)"},{"key":"17_CR30","unstructured":"Pagallo, G.: Learning dnf by decision trees. In: IJCAI - Volume 1. pp. 639\u2013644. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1989)"},{"key":"17_CR31","unstructured":"Pagallo, G.M.: Adaptative decision tree algorithms for learning from examples (PH.D. thesis). Technical report, Santa Cruz, CA, USA (1990)"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Ragavan, H., Rendell, L.A.: Lookahead feature construction for learning hard concepts. In: ICML, pp. 252\u2013259. Morgan Kaufmann Publishers Inc. (1993)","DOI":"10.1016\/B978-1-55860-307-3.50039-3"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, N., Kumar, D., Mishra, B., Potts, M., Helm, R.F.: Turning cartwheels: an alternating algorithm for mining redescriptions. In: KDD, pp. 266\u2013275. ACM, New York (2004)","DOI":"10.1145\/1014052.1014083"},{"issue":"3","key":"17_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0118432","volume":"10","author":"T Saito","year":"2015","unstructured":"Saito, T., Rehmsmeier, M.: The precision-recall plot is more informative than the roc plot when evaluating binary classifiers on imbalanced datasets. PLoS ONE 10(3), 1\u201321 (2015)","journal-title":"PLoS ONE"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-25966-4_33","volume-title":"Multiple Classifier Systems","author":"V Svetnik","year":"2004","unstructured":"Svetnik, V., Liaw, A., Tong, C., Wang, T.: Application of Breiman\u2019s random forest to modeling structure-activity relationships of pharmaceutical molecules. In: Roli, F., Kittler, J., Windeatt, T. (eds.) MCS 2004. LNCS, vol. 3077, pp. 334\u2013343. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25966-4_33"},{"key":"17_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-319-55696-3_14","volume-title":"Genetic Programming","author":"B Tran","year":"2017","unstructured":"Tran, B., Xue, B., Zhang, M.: Using feature clustering for GP-based feature construction on high-dimensional data. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 210\u2013226. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55696-3_14"},{"key":"17_CR37","unstructured":"Ucar, T., Hajiramezanali, E., Edwards, L.: SubTab: subsetting features of tabular data for self-supervised representation learning. In: NeurIPS, pp. 18853\u201318865 (2021)"},{"key":"17_CR38","unstructured":"UCI: UCI machine learning repository. https:\/\/archive.ics.uci.edu\/ml\/index.php. Accessed 05 July 2022"},{"key":"17_CR39","first-page":"66","volume":"10","author":"L Van Der Maaten","year":"2009","unstructured":"Van Der Maaten, L., Postma, E., Van den Herik, J.: Dimensionality reduction: a comparative review. J. Mach. Learn. Res. 10, 66\u201371 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR40","doi-asserted-by":"crossref","unstructured":"Vens, C., Costa, F.: Random forest based feature induction. In: Cook, D.J., Pei, J., Wang, W., Za\u00efane, O.R., Wu, X. (eds.) ICDM, pp. 744\u2013753. IEEE Computer Society (2011)","DOI":"10.1109\/ICDM.2011.121"},{"issue":"6","key":"17_CR41","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1093\/bioinformatics\/btq038","volume":"26","author":"M Wang","year":"2010","unstructured":"Wang, M., Chen, X., Zhang, H.: Maximal conditional chi-square importance in random forests. Bioinformatics 26(6), 831\u20137 (2010)","journal-title":"Bioinformatics"},{"key":"17_CR42","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). https:\/\/doi.org\/10.1007\/3-540-63223-9_108"},{"key":"17_CR43","unstructured":"Yang, D.S., Rendell, L., Blix, G.: A scheme for feature construction and a comparison of empirical methods. In: IJCAI - Volume 2, pp. 699\u2013704. Morgan Kaufmann Publishers Inc., San Francisco (1991)"},{"key":"17_CR44","unstructured":"Zheng, Z.: Constructing nominal X-of-N attributes. In: IJCAI - Volume 2, pp. 1064\u20131070. Morgan Kaufmann Publishers Inc., San Francisco (1995)"},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Feng, J.: Deep forest: towards an alternative to deep neural networks. In: Sierra, C. (ed.) IJCAI, pp. 3553\u20133559. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/497"}],"container-title":["Communications in Computer and Information Science","Machine Learning and Principles and Practice of Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23618-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T07:11:52Z","timestamp":1675062712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23618-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031236174","9783031236181"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23618-1_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"22% - 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":"3-4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 demo track papers have been accepted from 28 submissions","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)"}}]}}