{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T16:17:27Z","timestamp":1792945047102,"version":"4.5.0"},"reference-count":72,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100011039","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"publisher","award":["127228."],"award-info":[{"award-number":["127228."]}],"id":[{"id":"10.13039\/100011039","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1618637"],"award-info":[{"award-number":["1618637"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tpami.2020.3035599","type":"journal-article","created":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T21:04:44Z","timestamp":1604437484000},"page":"1-1","source":"Crossref","is-referenced-by-count":11,"title":["Self-Representation Based Unsupervised Exemplar Selection in a Union of Subspaces"],"prefix":"10.1109","author":[{"given":"Chong","family":"You","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rene","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30115-8_7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2004559"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7900"},{"key":"ref4","first-page":"1954","article-title":"Submodularity in data subset selection and active learning,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wei"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/bf00129684"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1177153"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.030"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2161862"},{"key":"ref9","first-page":"1057","article-title":"Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection,","author":"Das"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.05.031"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995434"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247852"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.118"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.10.014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2011.2166951"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206547"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1034"},{"key":"ref19","first-page":"1585","article-title":"Geometric conditions for subspace-sparse recovery,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"issue":"12","key":"ref20","first-page":"1","article-title":"Noisy sparse subspace clustering,","volume":"17","author":"Wang","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.460"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01240-3_5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordhb\/9780198744191.013.11"},{"key":"ref24","first-page":"3149","article-title":"Expectation-maximization for learning determinantal point processes,","volume-title":"Proc. 27th Int. Conf. Neural Inf. Process. Syst.","author":"Gillenwater"},{"key":"ref25","first-page":"1193","article-title":"k-DPPs: Fixed-size determinantal point processes,","volume-title":"Proc. 28th Int. Conf. Int. Conf. Mach. Learn.","author":"Kulesza"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.142"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.10.031"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(87)90103-0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref30","first-page":"2539","article-title":"Greedy column subset selection: New bounds and distributed algorithms,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Altschuler"},{"key":"ref31","first-page":"5409","article-title":"Iterative projection and matching: Finding structure-preserving representatives and its application to computer vision,","volume-title":"Proc. IEEE Conf. Comput. Vis. Pattern Recognit.","author":"Joneidi"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.226"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213994"},{"key":"ref34","first-page":"231","article-title":"Fast conical hull algorithms for near-separable non-negative matrix factorization,","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Kumar"},{"key":"ref35","first-page":"19","article-title":"Finding exemplars from pairwise dissimilarities via simultaneous sparse recovery,","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Elhamifar"},{"key":"ref36","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation,","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33786-4_26"},{"issue":"1","key":"ref38","first-page":"2487","article-title":"Greedy feature selection for subspace clustering,","volume":"14","author":"Dyer","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.426"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46475-6_45"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2762279"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869521"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2374631"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2781649"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.08.006"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2018.00065"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2019.05.017"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/39.1420-8970"},{"key":"ref50","article-title":"Neighborly polytopes and sparse solution of underdetermined linear equations,","author":"Donoho"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0099-z"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.425"},{"key":"ref53","first-page":"122","article-title":"Linear algebra, pr entice-hall,","author":"Hoffman","year":"1971"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000067"},{"key":"ref56","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding,","volume":"11","author":"Mairal","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref57","article-title":"VLFeat: An open and portable library of computer vision algorithms,","author":"Vedaldi","year":"2008"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2017.7966217"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.230"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2012.02.016"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.177"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472520"},{"key":"ref64","first-page":"622","article-title":"Online low-rank subspace clustering by basis dictionary pursuit,","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Shen"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2003.1261124"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0801-8"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1137\/130940670"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.764"},{"key":"ref70","article-title":"Sparse methods for learning multiple subspaces from large-scale, corrupted and imbalanced data,","author":"You","year":"2018"},{"issue":"50","key":"ref71","first-page":"40","article-title":"On covering a spherical surface with equal spherical caps (in Hungarian),","author":"Toth","year":"1943","journal-title":"Matematikai Fiz. Lapok"},{"key":"ref72","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0963-8","volume-title":"Unsolved Problems in Geometry","author":"Croft","year":"1991"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/4359286\/09247442.pdf?arnumber=9247442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T23:13:31Z","timestamp":1704842011000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9247442\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":72,"URL":"https:\/\/doi.org\/10.1109\/tpami.2020.3035599","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}