{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T17:56:39Z","timestamp":1773770199078,"version":"3.50.1"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1109\/tnnls.2020.3002576","type":"journal-article","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T21:30:53Z","timestamp":1593466253000},"page":"2195-2208","source":"Crossref","is-referenced-by-count":28,"title":["A Cheap Feature Selection Approach for the <i>K<\/i>-Means Algorithm"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7166-6940","authenticated-orcid":false,"given":"Marco","family":"Capo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8128-1099","authenticated-orcid":false,"given":"Aritz","family":"Perez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4683-8111","authenticated-orcid":false,"given":"Jose A.","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502546"},{"key":"ref38","first-page":"249","article-title":"Fast SVD for large-scale matrices","volume":"58","author":"holmes","year":"2007","journal-title":"Proc Workshop Efficient Mach Learn NIPS"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746569"},{"key":"ref32","first-page":"153","article-title":"Unsupervised feature selection for the k-means clustering problem","author":"boutsidis","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1961659.1961662"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1291233.1291331"},{"key":"ref37","first-page":"1","article-title":"Distributed PCA and k-means clustering","author":"liang","year":"2013","journal-title":"Proc Big Learn Workshop NIPS"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2010.tm09415"},{"key":"ref35","first-page":"1240","article-title":"Survey on feature selection in document clustering","volume":"3","author":"mugunthadevi","year":"2011","journal-title":"Int J Comput Sci Eng"},{"key":"ref34","first-page":"545","article-title":"Result analysis of the NIPS 2003 feature selection challenge","author":"guyon","year":"2005","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-007-0003-0"},{"key":"ref29","first-page":"2013","article-title":"Ultrahigh dimensional feature selection: Beyond the linear model","volume":"10","author":"fan","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015408"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.06.031"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247072"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(99)00069-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.01.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-011-9340-1"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.2307\/2284239"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref11","first-page":"585","article-title":"Convergence properties of the k-means algorithms","author":"bottou","year":"1995","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","first-page":"298","article-title":"Random projections for k-means clustering","author":"boutsidis","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10665-1_71"},{"key":"ref13","first-page":"42","article-title":"Accelerated k-means with adaptive distance bounds","author":"drake","year":"2012","journal-title":"Proc 5th NIPS Workshop Optim Mach Learn"},{"key":"ref14","first-page":"147","article-title":"Using the triangle inequality to accelerate k-means","author":"elkan","year":"2003","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.12"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772862"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00678-9"},{"key":"ref18","article-title":"Scalable k-Means clustering via lightweight coresets","author":"bachem","year":"2017","journal-title":"arXiv 1702 08248"},{"key":"ref19","first-page":"1995","article-title":"Distributed k-means and k-median clustering on general topologies","author":"balcan","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28349-8_2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2002.1017616"},{"key":"ref6","article-title":"Introduction to partitioning-based clustering methods with a robust example","author":"\u00e4yr\u00e4m\u00f6","year":"0","journal-title":"Rep Dept Math Inf Technol C Softw Eng Comput Intell"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00202-1_24"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"ref9","author":"kaufman","year":"1987","journal-title":"Clustering by Means of Medoids Amsterdam The Netherlands"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/34.709601"},{"key":"ref45","first-page":"507","article-title":"Laplacian score for feature selection","author":"he","year":"2006","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/513400.513402"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33460-3_28"},{"key":"ref42","volume":"454","author":"liu","year":"2012","journal-title":"Feature Selection for Knowledge Discovery and Data Mining"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835848"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1201\/9781315373515-2"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/9420773\/09127528.pdf?arnumber=9127528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:17Z","timestamp":1652194397000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9127528\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":50,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2020.3002576","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}