{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:54:34Z","timestamp":1760385274089},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/tit.2013.2255021","type":"journal-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T18:03:09Z","timestamp":1364407389000},"page":"6099-6110","source":"Crossref","is-referenced-by-count":43,"title":["Deterministic Feature Selection for K-Means Clustering"],"prefix":"10.1109","volume":"59","author":[{"given":"Christos","family":"Boutsidis","sequence":"first","affiliation":[]},{"given":"Malik","family":"Magdon-Ismail","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/sim.2082"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.167"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892123"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2004.843269"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2004.834070"},{"key":"ref30","author":"magdon-ismail","year":"2010","journal-title":"Row sampling for matrix algorithms via a non-commutative Bernstein bound"},{"key":"ref37","first-page":"911","article-title":"Sparse greedy matrix approximation for machine learning","author":"smola","year":"2000","journal-title":"Proc 7th Int Conf Machine Learning"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/jfan.1998.3384"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.75"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/050645506"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"ref12","first-page":"291","article-title":"Clustering in large graphs and matrices","author":"drineas","year":"1999","journal-title":"Proc 10th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1247069.1247072"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224208"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1137856.1137879"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/153244303322753616"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1008107"},{"key":"ref18","author":"golub","year":"1996","journal-title":"Matrix Computations"},{"key":"ref19","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":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.21"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536451"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"ref6","first-page":"153","article-title":"Unsupervised feature selection for the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-means clustering problem","author":"boutsidis","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.21"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1291233.1291297"},{"key":"ref8","author":"boutsidis","year":"2011","journal-title":"Manuscript under Review"},{"key":"ref7","article-title":"Random projections for <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-means clustering","author":"boutsidis","year":"2010","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref2","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":"ref9","author":"cui","year":"0","journal-title":"Orthogonal principal feature selection"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-642-03685-9_2","article-title":"Adaptive sampling for k-means clustering","author":"aggarwal","year":"2009","journal-title":"Proc 12th Int Workshop 13th Int Workshop Approximation Randomization Combinatorial Optimization"},{"key":"ref20","first-page":"126","article-title":"Smaller coresets for <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-median and <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-means clustering","author":"har-peled","year":"2005","journal-title":"Proc 21st Annu Symp Comput Geometry"},{"key":"ref22","article-title":"Laplacian score for feature selection","author":"he","year":"2006","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2307\/2346488"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.10.009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32241-9_2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2307\/2347842"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2346300"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6579681\/06488848.pdf?arnumber=6488848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:46Z","timestamp":1638218866000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6488848\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2255021","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}