{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:24:30Z","timestamp":1742912670420,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319729251"},{"type":"electronic","value":"9783319729268"}],"license":[{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-72926-8_20","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T17:42:36Z","timestamp":1513791756000},"page":"234-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Elementary Approach to the Problem of Column Selection in a Rectangular Matrix"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Chr\u00e9tien","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Darses","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"20_CR1","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics (2007)"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/120867287","volume":"34","author":"H Avron","year":"2013","unstructured":"Avron, H., Boutsidis, C.: Faster subset selection for matrices and applications. SIAM J. Matrix Anal. Appl. 34(4), 1464\u20131499 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BF02772174","volume":"57","author":"J Bourgain","year":"1987","unstructured":"Bourgain, J., Tzafriri, L.: Invertibility of \u201clarge\u201d submatrices with applications to the geometry of Banach spaces and harmonic analysis. Israel J. Math. 57(2), 137\u2013224 (1987)","journal-title":"Israel J. Math."},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/12086755X","volume":"43","author":"C Boutsidis","year":"2014","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal column-based matrix reconstruction. SIAM J. Comput. 43(2), 687\u2013717 (2014)","journal-title":"SIAM J. Comput."},{"key":"20_CR5","unstructured":"Boutsidis, C., Drineas, P., Mahoney, M.: On selecting exactly k columns from a matrix (2008, in press)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., Ghaoui, L.E., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. In: Advances in Neural Information Processing Systems, pp. 41\u201348 (2005)","DOI":"10.2139\/ssrn.563524"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-014-0801-8","volume":"45","author":"AK Farahat","year":"2015","unstructured":"Farahat, A.K., Elgohary, A., Ghodsi, A., Kamel, M.S.: Greedy column subset selection for large-scale data sets. Knowl. Inform. Syst. 45(1), 1\u201334 (2015)","journal-title":"Knowl. Inform. Syst."},{"issue":"10","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1002\/cpa.21413","volume":"65","author":"S Mallat","year":"2012","unstructured":"Mallat, S.: Group invariant scattering. Commun. Pure Appl. Math. 65(10), 1331\u20131398 (2012)","journal-title":"Commun. Pure Appl. Math."},{"issue":"8","key":"20_CR9","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/TPAMI.2012.230","volume":"35","author":"J Bruna","year":"2013","unstructured":"Bruna, J., Mallat, S.: Invariant scattering convolution networks. IEEE Trans. Pattern Anal. Mach. Intell. 35(8), 1872\u20131886 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"20_CR10","unstructured":"Naor, A.: Sparse quadratic forms and their geometric applications [following Batson, Spielman and Srivastava]. S\u00e9minaire Bourbaki: Vol. 2010\/2011. Expos\u00e9s 1027\u20131042. Ast\u00e9risque No. 348 (2012), Exp. No. 1033, viii, 189\u2013217"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Nikolov, A.: Randomized rounding for the largest simplex problem. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pp. 861\u2013870 (2015)","DOI":"10.1145\/2746539.2746628"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Nikolov, A., Singh, M.: Maximizing determinants under partition constraints. In: STOC 2016, pp. 192\u2013201 (2016)","DOI":"10.1145\/2897518.2897649"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11856-011-0194-2","volume":"190","author":"DA Spielman","year":"2012","unstructured":"Spielman, D.A., Srivastava, N.: An elementary proof of the restricted invertibility theorem. Israel J. Math. 190, 83\u201391 (2012)","journal-title":"Israel J. Math."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.4064\/sm185-1-4","volume":"185","author":"JA Tropp","year":"2008","unstructured":"Tropp, J.A.: The random paving property for uniformly bounded matrices. Studia Math. 185(1), 67\u201382 (2008)","journal-title":"Studia Math."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/j.crma.2008.10.008","volume":"346","author":"JA Tropp","year":"2008","unstructured":"Tropp, J.A.: Norms of random submatrices and sparse approximation. C. R. Acad. Sci. Paris, Ser. I 346, 1271\u20131274 (2008)","journal-title":"C. R. Acad. Sci. Paris, Ser. I"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Tropp, J.A.: Column subset selection, matrix factorization, and eigenvalue optimization. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 978\u2013986. Society for Industrial and Applied Mathematics (2009)","DOI":"10.1137\/1.9781611973068.106"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF02809903","volume":"122","author":"R Vershynin","year":"2001","unstructured":"Vershynin, R.: John\u2019s decompositions: selecting a large part. Israel J. Math. 122, 253\u2013277 (2001)","journal-title":"Israel J. Math."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"6431","DOI":"10.1093\/imrn\/rnt172","volume":"23","author":"P Youssef","year":"2014","unstructured":"Youssef, P.: A note on column subset selection. Int. Math. Res. Not. IMRN 23, 6431\u20136447 (2014)","journal-title":"Int. Math. Res. Not. IMRN"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72926-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:14:46Z","timestamp":1710335686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-72926-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,21]]},"ISBN":["9783319729251","9783319729268"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72926-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,21]]},"assertion":[{"value":"21 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Machine Learning, Optimization, and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.taosciences.it\/mod\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}