{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:57:50Z","timestamp":1762300670227,"version":"3.37.3"},"reference-count":42,"publisher":"IOP Publishing","issue":"2","license":[{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T00:00:00Z","timestamp":1712793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"crossref","award":["DEAC06-76RL01830"],"award-info":[{"award-number":["DEAC06-76RL01830"]}],"id":[{"id":"10.13039\/100006192","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":[[2024,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Machine learning is most often expensive in terms of computational and memory costs due to training with large volumes of data. Current computational limitations of many computing systems motivate us to investigate practical approaches, such as feature selection and reduction, to reduce the time and memory costs while not sacrificing the accuracy of classification algorithms. In this work, we carefully review, analyze, and identify the feature reduction methods that have low costs\/overheads in terms of time and memory. Then, we evaluate the identified reduction methods in terms of their impact on the accuracy, precision, time, and memory costs of traditional classification algorithms. <jats:italic>Specifically, we focus on the least resource intensive feature reduction methods that are available in Scikit-Learn library. Since our goal is to identify the best performing low-cost reduction methods, we do not consider complex expensive reduction algorithms in this study.<\/jats:italic> In our evaluation, we find that at quadratic-scale feature reduction, the classification algorithms achieve the best trade-off among competitive performance metrics. Results show that the overall training times are reduced 61%, the model sizes are reduced 6\u00d7, and accuracy scores increase 25% compared to the baselines on average with quadratic scale reduction.<\/jats:p>","DOI":"10.1088\/2632-2153\/ad3726","type":"journal-article","created":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T22:44:35Z","timestamp":1711147475000},"page":"020501","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Analysis and Benchmarking of feature reduction for classification under computational constraints"],"prefix":"10.1088","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5373-7570","authenticated-orcid":true,"given":"Omer","family":"Subasi","sequence":"first","affiliation":[]},{"given":"Sayan","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Joseph","family":"Manzano","sequence":"additional","affiliation":[]},{"given":"Bruce","family":"Palmer","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9s","family":"Marquez","sequence":"additional","affiliation":[]}],"member":"266","published-online":{"date-parts":[[2024,4,11]]},"reference":[{"key":"mlstad3726bib1","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/s42979-021-00815-1","article-title":"Deep learning: a comprehensive overview on techniques, taxonomy, applications and research directions","volume":"2","author":"Sarker","year":"2021","journal-title":"SN Comput. Sci."},{"key":"mlstad3726bib2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100379","article-title":"A survey on deep learning and its applications","volume":"40","author":"Dong","year":"2021","journal-title":"Comput. Sci. Rev."},{"key":"mlstad3726bib3","first-page":"pp 1","article-title":"Survey of machine learning accelerators","author":"Reuther","year":"2020"},{"key":"mlstad3726bib4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3377454","article-title":"A survey on distributed machine learning","volume":"53","author":"Verbraeken","year":"2020","journal-title":"ACM Comput. Surv."},{"key":"mlstad3726bib5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3469029","article-title":"Machine learning at the network edge: a survey","volume":"54","author":"Murshed","year":"2021","journal-title":"ACM Comput. Surv."},{"key":"mlstad3726bib6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3533378","article-title":"Challenges in deploying machine learning: a survey of case studies","volume":"55","author":"Paleyes","year":"2022","journal-title":"ACM Comput. Surv."},{"key":"mlstad3726bib7","first-page":"2825","article-title":"Scikit-learn: machine learning in python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"J. Mach. Learn. Res."},{"article-title":"An implementation of a randomized algorithm for principal component analysis","year":"2014","author":"Szlam","key":"mlstad3726bib8"},{"article-title":"Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions","year":"2009","author":"Halko","key":"mlstad3726bib9"},{"article-title":"Experiments with random projection","year":"2013","author":"Dasgupta","key":"mlstad3726bib10"},{"key":"mlstad3726bib11","first-page":"pp 245","article-title":"Random projection in dimensionality reduction: applications to image and text data","author":"Bingham","year":"2001"},{"key":"mlstad3726bib12","first-page":"pp 287","article-title":"Very sparse random projections","author":"Li","year":"2006"},{"key":"mlstad3726bib13","first-page":"1","article-title":"Feature selection: a data perspective","volume":"50","author":"Li","year":"2017","journal-title":"ACM Comput. Surv."},{"key":"mlstad3726bib14","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s10462-019-09682-y","article-title":"A review of unsupervised feature selection methods","volume":"53","author":"Solorio-Fern\u00e1ndez","year":"2020","journal-title":"Artif. Intell. Rev."},{"key":"mlstad3726bib15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ecoinf.2021.101224","article-title":"An evaluation of feature selection methods for environmental data","volume":"61","author":"Effrosynidis","year":"2021","journal-title":"Ecol. Inform."},{"key":"mlstad3726bib16","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1012487302797","article-title":"Gene selection for cancer classification using support vector machines","volume":"46","author":"Guyon","year":"2002","journal-title":"Mach. Learn."},{"article-title":"Selectfrommodel","year":"2023","author":"Scikit-Learn","key":"mlstad3726bib17"},{"key":"mlstad3726bib18","first-page":"pp 403","article-title":"Comparative study of techniques for large-scale feature selection","author":"Ferri","year":"1994"},{"article-title":"Manifold learning","year":"2023","author":"Scikit-Learn","key":"mlstad3726bib19"},{"article-title":"Feature agglomeration","year":"2023","author":"Scikit-learn","key":"mlstad3726bib20"},{"article-title":"Predicting a biological response","year":"2011","author":"Boehringer Ingelheim","key":"mlstad3726bib21"},{"article-title":"Uci ml breast cancer wisconsin dataset","year":"2023","author":"Mangasarian Dr.","key":"mlstad3726bib22"},{"article-title":"Blackard and Colorado state university. forest covertypes dataset","year":"2023","author":"Jock","key":"mlstad3726bib23"},{"article-title":"Eeg eye state data set","year":"2023","author":"Baden-Wuerttemberg","key":"mlstad3726bib24"},{"article-title":"Hill valley dataset. A noiseless version of the data set","year":"2023","author":"Franz Oppacher Lee Graham","key":"mlstad3726bib25"},{"article-title":"Kdd dataset","year":"2023","author":"MIT Lincoln Lab","key":"mlstad3726bib26"},{"key":"mlstad3726bib27","first-page":"p 17","article-title":"Result analysis of the nips 2003 feature selection challenge","author":"Guyon","year":"2004"},{"key":"mlstad3726bib28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2010\/616358","article-title":"Stability of ranked gene lists in large microarray analysis studies","volume":"2010","author":"Stiglic","year":"2010","journal-title":"J. biomed. biotechnol."},{"article-title":"Scikit-learn make_classification","year":"2023","author":"Scikit-Learn","key":"mlstad3726bib29"},{"article-title":"Datasets from the agnostic learning vs. prior knowledge challenge","year":"2023","author":"US Forest Service (USFS) Region 2 Resource Information System","key":"mlstad3726bib30"},{"article-title":"Support vector machines: tips on practical use","year":"2023","author":"Scikit-Learn","key":"mlstad3726bib31"},{"article-title":"Support vector machines: tips on practical use","year":"2023","author":"Scikit-Learn","key":"mlstad3726bib32"},{"key":"mlstad3726bib33","doi-asserted-by":"publisher","first-page":"2663","DOI":"10.1007\/s40747-021-00637-x","article-title":"Feature dimensionality reduction: a review","volume":"8","author":"Jia","year":"2022","journal-title":"Complex Intell. Syst."},{"key":"mlstad3726bib34","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.inffus.2020.01.005","article-title":"Overview and comparative study of dimensionality reduction techniques for high dimensional data","volume":"59","author":"Ayesha","year":"2020","journal-title":"Inf. Fusion"},{"key":"mlstad3726bib35","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.patcog.2008.08.001","article-title":"Performance of feature-selection methods in the classification of high-dimension data","volume":"42","author":"Hua","year":"2009","journal-title":"Pattern Recognit."},{"key":"mlstad3726bib36","doi-asserted-by":"publisher","first-page":"8170","DOI":"10.1016\/j.eswa.2010.12.160","article-title":"Empirical study of feature selection methods based on individual feature evaluation for classification problems","volume":"38","author":"Arauzo-Azofra","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"mlstad3726bib37","first-page":"pp 69","article-title":"Comparison of feature reduction methods and machine learning models for breast cancer diagnosis","author":"Avramov","year":"2017"},{"key":"mlstad3726bib38","doi-asserted-by":"publisher","first-page":"1925","DOI":"10.1007\/s10664-018-9679-5","article-title":"The impact of feature reduction techniques on defect prediction models","volume":"24","author":"Kondo","year":"2019","journal-title":"Empir. Softw. Eng."},{"key":"mlstad3726bib39","article-title":"Lightgbm: A highly efficient gradient boosting decision tree","volume":"vol 30","author":"Ke","year":"2017"},{"key":"mlstad3726bib40","article-title":"A unified approach to interpreting model predictions","volume":"vol 30","author":"Lundberg","year":"2017"},{"key":"mlstad3726bib41","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2019.106839","article-title":"Benchmark for filter methods for feature selection in high-dimensional classification data","volume":"143","author":"Bommert","year":"2020","journal-title":"Comput. Stat. Data Anal."},{"key":"mlstad3726bib42","first-page":"pp 71","article-title":"Impact of filter feature selection on classification: an empirical study","author":"Njoku","year":"2022"}],"container-title":["Machine Learning: Science and Technology"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,11]],"date-time":"2024-04-11T08:57:54Z","timestamp":1712825874000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad3726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,11]]},"references-count":42,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2024,4,11]]},"published-print":{"date-parts":[[2024,6,1]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-2153\/ad3726","relation":{},"ISSN":["2632-2153"],"issn-type":[{"type":"electronic","value":"2632-2153"}],"subject":[],"published":{"date-parts":[[2024,4,11]]},"assertion":[{"value":"Analysis and Benchmarking of feature reduction for classification under computational constraints","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 2024 The Author(s). Published by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"value":"2023-11-09","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2024-03-22","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2024-04-11","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}