{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:25:19Z","timestamp":1729653919383,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/icassp.2017.7952995","type":"proceedings-article","created":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T17:35:36Z","timestamp":1497980136000},"page":"4436-4440","source":"Crossref","is-referenced-by-count":5,"title":["Fast exemplar selection algorithm for matrix approximation and representation: A variant oASIS algorithm"],"prefix":"10.1109","author":[{"given":"V.","family":"Abrol","sequence":"first","affiliation":[]},{"given":"P.","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"A. K.","family":"Sao","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2044251"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2011.06.033"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(87)90103-0"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0917055"},{"key":"ref12","first-page":"3475","article-title":"Fast approximation of matrix coherence and statistical leverage","volume":"13","author":"drineas","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a012"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247852"},{"key":"ref16","first-page":"278","article-title":"A novel greedy algorithm for nyström approximation","volume":"15","author":"farahat","year":"2011","journal-title":"International Conference on Artificial Intelligence and Statistics (AISTATS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2347372"},{"journal-title":"Introduction to Linear Algebra","year":"2003","author":"strang","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.22"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2016.04.014"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2011.11.019","article-title":"Column subset selection via sparse approximation of {SVD}","volume":"421","author":"\u00e7ivril","year":"2012","journal-title":"Theoretical Computer Science"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.08.034"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.106"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.88"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/11830924_28","author":"deshpande","year":"2006","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques ser APPROX'06\/RANDOM'06"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833344","author":"bernstein","year":"2009","journal-title":"Matrix Mathematics Theory Facts and Formulas"},{"key":"ref7","first-page":"1","article-title":"Greedy column subset selection for large-scale data sets","author":"farahat","year":"2014","journal-title":"Knowledge and Information Systems"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.jcss.2014.01.004","article-title":"Column subset selection problem is UG-hard","volume":"80","author":"\u00e7ivril","year":"2014","journal-title":"Journal of Computerand System Sciences"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/78.482114"},{"journal-title":"oASIS Adaptive Column Sampling for Kernel Matrix Approximation","year":"2015","author":"patel","key":"ref1"},{"key":"ref20","article-title":"A fast greedy algorithm for generalized column subset selection","author":"farahat","year":"2013","journal-title":"NIPS workshop on Greedy Algorithms"},{"journal-title":"Self-Expressive Decompositions for Matrix Approximation and Clustering","year":"2015","author":"dyer","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref24","first-page":"19","article-title":"Finding exemplars from pairwise dissimilarities via simultaneous sparse recovery","author":"elhamifar","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/34.927464"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.specom.2016.09.004"},{"key":"ref25","first-page":"2487","article-title":"Greedy feature selection for subspace clustering","volume":"14","author":"dyer","year":"2013","journal-title":"Journal of Machine Learning Research"}],"event":{"name":"2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2017,3,5]]},"location":"New Orleans, LA","end":{"date-parts":[[2017,3,9]]}},"container-title":["2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7943262\/7951776\/07952995.pdf?arnumber=7952995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T07:24:46Z","timestamp":1569482686000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7952995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icassp.2017.7952995","relation":{},"subject":[],"published":{"date-parts":[[2017,3]]}}}