{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T15:12:52Z","timestamp":1767453172098,"version":"3.37.3"},"reference-count":44,"publisher":"IOP Publishing","issue":"4","license":[{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"crossref","award":["K135837"],"award-info":[{"award-number":["K135837"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["Mach. Learn.: Sci. Technol."],"published-print":{"date-parts":[[2023,12,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In recent years, several screening methods have been published for ultrahigh-dimensional data that contain hundreds of thousands of features, many of which are irrelevant or redundant. However, most of these methods cannot handle data with thousands of classes. Prediction models built to authenticate users based on multichannel biometric data result in this type of problem. In this study, we present a novel method known as <jats:italic>random forest-based multiround screening (RFMS)<\/jats:italic> that can be effectively applied under such circumstances. The proposed algorithm divides the feature space into small subsets and executes a series of partial model builds. These partial models are used to implement tournament-based sorting and the selection of features based on their importance. This algorithm successfully filters irrelevant features and also discovers binary and higher-order feature interactions. To benchmark RFMS, a synthetic biometric feature space generator known as <jats:italic>BiometricBlender<\/jats:italic> is employed. Based on the results, the RFMS is on par with industry-standard feature screening methods, while simultaneously possessing many advantages over them.<\/jats:p>","DOI":"10.1088\/2632-2153\/ad020e","type":"journal-article","created":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T22:41:29Z","timestamp":1696977689000},"page":"045012","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Feature space reduction method for ultrahigh-dimensional, multiclass data: random forest-based multiround screening (RFMS)"],"prefix":"10.1088","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0222-1400","authenticated-orcid":false,"given":"Gergely","family":"Hancz\u00e1r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9954-8089","authenticated-orcid":false,"given":"Marcell","family":"Stippinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0678-9885","authenticated-orcid":true,"given":"D\u00e1vid","family":"Han\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0121-6781","authenticated-orcid":true,"given":"Marcell T","family":"Kurbucz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2148-9189","authenticated-orcid":false,"given":"Oliv\u00e9r M","family":"T\u00f6rteli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2863-5257","authenticated-orcid":false,"given":"\u00c1gnes","family":"Chripk\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4385-3025","authenticated-orcid":false,"given":"Zolt\u00e1n","family":"Somogyv\u00e1ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"266","published-online":{"date-parts":[[2023,10,19]]},"reference":[{"key":"mlstad020ebib1","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1198\/jasa.2008.tm08516","volume":"104","author":"Wang","year":"2009","journal-title":"J. Am. Stat. Assoc."},{"key":"mlstad020ebib2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1080\/02664763.2020.1815672","volume":"49","author":"Tan","year":"2022","journal-title":"J. Appl. Stat."},{"key":"mlstad020ebib3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1109\/MIS.2017.38","volume":"32","author":"Li","year":"2017","journal-title":"IEEE Intell. Syst."},{"key":"mlstad020ebib4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.eswa.2019.05.028","volume":"134","author":"Speiser","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"mlstad020ebib5","doi-asserted-by":"publisher","first-page":"4104","DOI":"10.1214\/09-AOS709","volume":"37","author":"Jung","year":"2009","journal-title":"Ann. Stat."},{"key":"mlstad020ebib6","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109180","volume":"251","author":"Koszty\u00e1n","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"mlstad020ebib7","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.jmva.2019.04.006","volume":"173","author":"Yang","year":"2019","journal-title":"J. Multivariate Anal."},{"key":"mlstad020ebib8","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1111\/j.1467-9868.2008.00674.x","volume":"70","author":"Fan","year":"2008","journal-title":"J. R. Stat. Soc. B"},{"key":"mlstad020ebib9","doi-asserted-by":"publisher","first-page":"2605","DOI":"10.1214\/07-AOS504","volume":"36","author":"Fan","year":"2008","journal-title":"Ann. Stat."},{"key":"mlstad020ebib10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1093\/biomet\/ass062","volume":"100","author":"Mai","year":"2013","journal-title":"Biometrika"},{"key":"mlstad020ebib11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.spl.2017.02.011","volume":"125","author":"Lai","year":"2017","journal-title":"Stat. Probab. Lett."},{"year":"2022","author":"Roy","key":"mlstad020ebib12"},{"key":"mlstad020ebib13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jmva.2003.12.002","volume":"93","author":"Sz\u00e9kely","year":"2005","journal-title":"J. Multivariate Anal."},{"key":"mlstad020ebib14","first-page":"1333","volume":"20","author":"Baringhaus","year":"2010","journal-title":"Stat. Sin."},{"key":"mlstad020ebib15","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1214\/14-AOS1303","volume":"43","author":"Mai","year":"2015","journal-title":"Ann. Stat."},{"key":"mlstad020ebib16","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00184-017-0629-9","volume":"80","author":"Ni","year":"2017","journal-title":"Metrika"},{"key":"mlstad020ebib17","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1080\/10485252.2016.1167206","volume":"28","author":"Ni","year":"2016","journal-title":"J. Nonparametr. Stat."},{"key":"mlstad020ebib18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114072","volume":"166","author":"Amini","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"mlstad020ebib19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.asoc.2017.12.048","volume":"65","author":"Dong","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"mlstad020ebib20","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s00500-016-2385-6","volume":"22","author":"Gu","year":"2018","journal-title":"Soft Comput."},{"key":"mlstad020ebib21","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.3233\/JIFS-169162","volume":"31","author":"Zhang","year":"2016","journal-title":"J. Intell. Fuzzy Syst."},{"key":"mlstad020ebib22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105581","volume":"82","author":"Hosseini","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"mlstad020ebib23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.106031","volume":"88","author":"Xue","year":"2020","journal-title":"Appl. Soft Comput."},{"article-title":"The UCI machine learning repository","year":"2023","author":"Kelly","key":"mlstad020ebib24"},{"key":"mlstad020ebib25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110240","volume":"142","author":"Saadatmand","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"mlstad020ebib26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"mlstad020ebib27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12863-015-0294-9","volume":"16","author":"Wang","year":"2015","journal-title":"BMC Genet."},{"year":"2023","author":"Hancz\u00e1r","key":"mlstad020ebib28"},{"key":"mlstad020ebib29","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1109\/ICDAR.2015.7333948","article-title":"ICDAR2015 competition on signature verification and writer identification for on- and off-line skilled forgeries (SigWIcomp2015)","author":"Malik","year":"2015"},{"key":"mlstad020ebib30","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2023.101366","volume":"22","author":"Stippinger","year":"2023","journal-title":"SoftwareX"},{"year":"2022","author":"Stippinger","key":"mlstad020ebib31"},{"key":"mlstad020ebib32","doi-asserted-by":"publisher","first-page":"238","DOI":"10.2307\/1403797","volume":"57","author":"Fix","year":"1989","journal-title":"Int. Stat. Rev."},{"key":"mlstad020ebib33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"year":"1998","author":"Vapnik","key":"mlstad020ebib34"},{"key":"mlstad020ebib35","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"Pearson","year":"1901","journal-title":"London, Edinburgh Dublin Phil. Mag. J. Sci."},{"key":"mlstad020ebib36","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1037\/h0071325","volume":"24","author":"Hotelling","year":"1933","journal-title":"J. Educ. Psychol."},{"key":"mlstad020ebib37","doi-asserted-by":"publisher","first-page":"201","DOI":"10.2307\/1412107","volume":"15","author":"Spearman","year":"1904","journal-title":"Am. J. Psychol."},{"key":"mlstad020ebib38","doi-asserted-by":"publisher","first-page":"79","DOI":"10.20982\/tqmp.09.2.p079","volume":"9","author":"Yong","year":"2013","journal-title":"Tutorials Quant. Methods Psychol."},{"key":"mlstad020ebib39","doi-asserted-by":"publisher","first-page":"p III","DOI":"10.1109\/ISCAS.2002.1010213","article-title":"A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels","volume":"vol 3","author":"Wong","year":"2002"},{"key":"mlstad020ebib40","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0178501","volume":"12","author":"Friedman","year":"2017","journal-title":"PLoS One"},{"article-title":"\u00dcgyfelek fizet\u0151k\u00e9pess\u00e9g\u00e9nek, megb\u00edzhat\u00f3s\u00e1g\u00e1nak becsl\u00e9se testbesz\u00e9d \u00e9s m\u00e1s motoros koordin\u00e1ci\u00f3 alapj\u00e1n","year":"2023","author":"Hancz\u00e1r","key":"mlstad020ebib41"},{"key":"mlstad020ebib42","first-page":"16","volume":"16","author":"Glickman","year":"1995","journal-title":"Boston Univ."},{"key":"mlstad020ebib43","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/34.990133","volume":"24","author":"Mitra","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"mlstad020ebib44","doi-asserted-by":"publisher","first-page":"128","DOI":"10.22503\/inftars.xxii.2022.2.8","volume":"22","author":"H\u00e9der","year":"2022","journal-title":"Inf. Tarsadalom"}],"container-title":["Machine Learning: Science and Technology"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T09:24:33Z","timestamp":1697707473000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad020e"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,19]]},"references-count":44,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,10,19]]},"published-print":{"date-parts":[[2023,12,1]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-2153\/ad020e","relation":{},"ISSN":["2632-2153"],"issn-type":[{"type":"electronic","value":"2632-2153"}],"subject":[],"published":{"date-parts":[[2023,10,19]]},"assertion":[{"value":"Feature space reduction method for ultrahigh-dimensional, multiclass data: random forest-based multiround screening (RFMS)","name":"article_title","label":"Article Title"},{"value":"Machine Learning: Science and Technology","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"\u00a9 2023 The Author(s). Published by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"value":"2023-06-26","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2023-10-10","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2023-10-19","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}