{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:01:01Z","timestamp":1742972461427,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_1","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Subspace Approximation with Outliers"],"prefix":"10.1007","author":[{"given":"Amit","family":"Deshpande","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rameshwar","family":"Pratap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"1_CR1","unstructured":"Bhaskara, A., Kumar, S.: Low rank approximation in the presence of outliers. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2018, 20\u201322 August 2018 - Princeton, NJ, USA, pp. 4:1\u20134:16 (2018)"},{"key":"1_CR2","unstructured":"Chen, K.: A constant factor approximation algorithm for k-median clustering with outliers. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, 20\u201322 January 2008, pp. 826\u2013835 (2008)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Input sparsity and hardness for robust subspace approximation. In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17\u201320 October 2015, pp. 310\u2013329 (2015)","DOI":"10.1109\/FOCS.2015.27"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Varadarajan, K.R.: Sampling-based dimension reduction for subspace approximation. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007, pp. 641\u2013650 (2007)","DOI":"10.1145\/1250790.1250884"},{"key":"1_CR5","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":"1_CR6","doi-asserted-by":"crossref","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, SODA 2010, Austin, Texas, USA, 17\u201319 January 2010, pp. 630\u2013649 (2010)","DOI":"10.1137\/1.9781611973075.53"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Feldman, D., Schulman, L.J.: Data reduction for weighted and outlier-resistant clustering. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 1343\u20131354 (2012)","DOI":"10.1137\/1.9781611973099.106"},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1145\/1039488.1039494","volume":"51","author":"AM Frieze","year":"2004","unstructured":"Frieze, A.M., Kannan, R., Vempala, S.S.: Fast Monte-Carlo algorithms for finding low-rank approximations. J. ACM 51(6), 1025\u20131041 (2004)","journal-title":"J. ACM"},{"key":"1_CR9","unstructured":"Ghashami, M., Phillips, J.M.: Relative errors for deterministic low-rank matrix approximations. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 707\u2013717 (2014)"},{"key":"1_CR10","unstructured":"Hardt, M., Moitra, A.: Algorithms and hardness for robust subspace recovery. In: COLT 2013 - The 26th Annual Conference on Learning Theory, 12\u201314 June 2013, Princeton University, NJ, USA, pp. 354\u2013375 (2013)"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/jcom.1995.1005","volume":"11","author":"L Khachiyan","year":"1995","unstructured":"Khachiyan, L.: On the complexity of approximating extremal determinants in matrices. J. Complex. 11(1), 138\u2013153 (1995)","journal-title":"J. Complex."},{"key":"1_CR12","unstructured":"Klivans, A., Kothari, P.K., Meka, R.: Efficient algorithms for outlier-robust regression. In Conference on Learning Theory, COLT 2018, Stockholm, Sweden, 6\u20139 July 2018, pp. 1420\u20131430 (2018)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Krishnaswamy, R., Li, S., Sandeep, S.: Constant approximation for k-median and k-means with outliers via iterative rounding. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, 25\u201329 June 2018, pp. 646\u2013659 (2018)","DOI":"10.1145\/3188745.3188882"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Lai, K.A., Rao, A.B., Vempala, S.: Agnostic estimation of mean and covariance. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9\u201311 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pp. 665\u2013674 (2016)","DOI":"10.1109\/FOCS.2016.76"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Liberty, E.: Simple and deterministic matrix sketching. In: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2013, Chicago, IL, USA, 11\u201314 August 2013, pp. 581\u2013588 (2013)","DOI":"10.1145\/2487575.2487623"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5\u20138 June 2010, pp. 755\u2013764 (2010)","DOI":"10.1145\/1806689.1806792"},{"key":"1_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"},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s00454-011-9384-2","volume":"47","author":"ND Shyamalkumar","year":"2012","unstructured":"Shyamalkumar, N.D., Varadarajan, K.R.: Efficient subspace approximation algorithms. Discrete Comput. Geom. 47(1), 44\u201363 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"1_CR19","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends\u00ae Theoret. Comput. Sci. 10(1\u20132), 1\u2013157 (2014)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T10:08:27Z","timestamp":1696586907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}