{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:50:22Z","timestamp":1725983422366},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-94667-2_28","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T07:56:24Z","timestamp":1530604584000},"page":"336-348","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster Coreset Construction for Projective Clustering via Low-Rank Approximation"],"prefix":"10.1007","author":[{"given":"Rameshwar","family":"Pratap","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"PK Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J. ACM 51(4), 606\u2013635 (2004)","journal-title":"J. ACM"},{"key":"28_CR2","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Welzl, E., (ed.) Current Trends in Combinatorial and Computational Geometry (2007)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/1.9781611973068.105","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Christos Boutsidis","year":"2009","unstructured":"Boutsidis, C., Mahoney, M.W., Drineas, P.: An improved approximation algorithm for the column subset selection problem. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4\u20136 January 2009, pp. 968\u2013977 (2009)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low rank approximation and regression in input sparsity time. In: Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1\u20134 June 2013, pp. 81\u201390 (2013)","DOI":"10.1145\/2488608.2488620"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Elder, S., Musco, C., Musco, C., Persu, M.: Dimensionality reduction for k-means clustering and low rank approximation. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14\u201317 June 2015, pp. 163\u2013172 (2015)","DOI":"10.1145\/2746539.2746569"},{"key":"28_CR6","unstructured":"Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, Oregon, USA, pp. 226\u2013231 (1996)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, D., Fiat, A., Sharir, M.: Coresets forweighted facilities and their applications. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21\u201324 October 2006, Berkeley, California, USA, Proceedings, pp. 315\u2013324 (2006)","DOI":"10.1109\/FOCS.2006.22"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, D., Langberg, M.: A unified framework for approximating and clustering data. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6\u20138 June 2011, pp. 569\u2013578 (2011)","DOI":"10.1145\/1993636.1993712"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1137\/1.9781611973075.53","volume-title":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Dan Feldman","year":"2010","unstructured":"Feldman, D., Monemizadeh, M., Sohler, C., Woodruff, D.P.: Coresets and sketches for high dimensional subspace approximation problems. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 630\u2013649 (2010)"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1137\/1.9781611973105.103","volume-title":"Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Dan Feldman","year":"2013","unstructured":"Feldman, D., Schmidt, M., Sohler, C.: Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1434\u20131453 (2013)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-30538-5_27","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"Sariel Har-Peled","year":"2004","unstructured":"Har-Peled, S.: No, coreset, no cry. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 3328, pp. 324\u2013335. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30538-5_27"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 291\u2013300 (2004)","DOI":"10.1145\/1007352.1007400"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: Proceedings of a DIMACS Workshop on External Memory Algorithms, New Brunswick, New Jersey, USA, 20\u201322 May 1998, pp. 107\u2013118 (1998)","DOI":"10.1090\/dimacs\/050\/05"},{"key":"28_CR14","unstructured":"Hinneburg, A., Aggarwal, C.C., Keim, D.A.: What is the nearest neighbor in high dimensional spaces? In: VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, 10\u201314 September 2000, Cairo, Egypt, pp. 506\u2013515 (2000)"},{"issue":"2","key":"28_CR15","first-page":"123","volume":"3","author":"MW Mahoney","year":"2011","unstructured":"Mahoney, M.W.: Randomized algorithms for matrices and data. Found. Trends Mach. Learn. 3(2), 123\u2013224 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"28_CR16","unstructured":"Phillips, J.M.: Coresets and sketches. CoRR, abs\/1601.00617 (2016)"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s, T.: Improved approximation algorithms for large matrices via random projections. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21\u201324 October 2006, Berkeley, California, USA, Proceedings, pp. 143\u2013152 (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1137\/1.9781611973099.105","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Kasturi Varadarajan","year":"2012","unstructured":"Varadarajan, K.R., Xiao, X.: A near-linear algorithm for projective clustering integer points. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 1329\u20131342 (2012)"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: A new data clustering algorithm and its applications. Data Min. Knowl. Discov. 1(2), 141\u2013182 (1997)","journal-title":"Data Min. Knowl. Discov."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T08:09:13Z","timestamp":1571558953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}