{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:35:34Z","timestamp":1726072534708},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_10","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"105-121","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["CUR LRA at Sublinear Cost Based on Volume Maximization"],"prefix":"10.1007","author":[{"given":"Qi","family":"Luan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor Y.","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/PL00005410","volume":"86","author":"M Bebendorf","year":"2000","unstructured":"Bebendorf, M.: Approximation of boundary element matrices. Numer. Math. 86(4), 565\u2013589 (2000)","journal-title":"Numer. Math."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1137\/S0895479891223781","volume":"15","author":"S Chandrasekaran","year":"1994","unstructured":"Chandrasekaran, S., Ipsen, I.: On rank revealing QR factorizations. SIAM J. Matrix Anal. Appl. 15, 592\u2013622 (1994)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Cortinovis, A., Kressner, D., Massei, S.: MATHICSE technical report: on maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices. MATHICSE, 12 February 2019","DOI":"10.1016\/j.laa.2020.02.010"},{"issue":"47\u201349","key":"10_CR4","doi-asserted-by":"publisher","first-page":"4801","DOI":"10.1016\/j.tcs.2009.06.018","volume":"410","author":"A \u00c7ivril","year":"2009","unstructured":"\u00c7ivril, A., Magdon-Ismail, M.: On selecting a maximum volume sub-matrix of a matrix and related problems. Theor. Comput. Sci. 410(47\u201349), 4801\u20134811 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Relative-error CUR matrix decompositions. SIAM J. Matrix Anal. Appl. 30(2), 844\u2013881 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1137\/0917055","volume":"17","author":"M Gu","year":"1996","unstructured":"Gu, M., Eisenstat, S.C.: An efficient algorithm for computing a strong rank revealing QR factorization. SIAM J. Sci. Comput. 17, 848\u2013869 (1996)","journal-title":"SIAM J. Sci. Comput."},{"key":"10_CR7","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. The Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1090\/conm\/280\/4620","volume":"208","author":"SA Goreinov","year":"2001","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E.: The maximal-volume concept in approximation by low rank matrices. Contemp. Math. 208, 47\u201351 (2001)","journal-title":"Contemp. Math."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00301-1","volume":"261","author":"SA Goreinov","year":"1997","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: A theory of pseudo-skeleton approximations. Linear Algebra Appl. 261, 1\u201321 (1997)","journal-title":"Linear Algebra Appl."},{"key":"10_CR10","unstructured":"Luan, Q., Pan, V.Y.: Low rank approximation of a matrix at sublinear cost, 21 July 2019. arXiv:1907.10481"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. USA 106, 697\u2013702 (2009)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Musco, C., Woodruff, D.P.: Sublinear time low-rank approximation of positive semidefinite matrices. In: IEEE 58th FOCS, pp. 672\u2013683 (2017)","DOI":"10.1109\/FOCS.2017.68"},{"key":"10_CR13","unstructured":"Osinsky, A.I.: Probabilistic estimation of the rank 1 cross approximation accuracy, submitted on 30 June 2017. arXiv:1706.10285"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.laa.2017.09.032","volume":"537","author":"AI Osinsky","year":"2018","unstructured":"Osinsky, A.I., Zamarashkin, N.L.: Pseudo-skeleton approximations with better accuracy estimates. Linear Algebra Appl. 537, 221\u2013249 (2018)","journal-title":"Linear Algebra Appl."},{"key":"10_CR15","unstructured":"Pan, V.Y., Luan, Q.: Refinement of low rank approximation of a matrix at sub-linear cost, submitted on 10 June 2019. arXiv:1906.04223"},{"key":"10_CR16","unstructured":"Pan, V.Y., Luan, Q., Svadlenka, J., Zhao, L.: Primitive and cynical low rank approximation, preprocessing and extensions, submitted on 3 November 2016. arXiv:1611.01391v1"},{"key":"10_CR17","unstructured":"Pan, V.Y., Luan, Q., Svadlenka, J., Zhao, L.: Superfast accurate approximation of low rank matrices, submitted on 22 October 2017. arXiv:1710.07946v1"},{"key":"10_CR18","unstructured":"Pan, V.Y., Luan, Q., Svadlenka, J., Zhao, L.: CUR low rank approximation at sub-linear cost, submitted on 10 June 2019. arXiv:1906.04112"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.laa.2015.04.021","volume":"481","author":"VY Pan","year":"2015","unstructured":"Pan, V.Y., Qian, G., Yan, X.: Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation. Linear Algebra Appl. 481, 202\u2013234 (2015)","journal-title":"Linear Algebra Appl."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.laa.2016.09.035","volume":"527","author":"VY Pan","year":"2017","unstructured":"Pan, V.Y., Zhao, L.: New studies of randomized augmentation and additive preprocessing. Linear Algebra Appl. 527, 256\u2013305 (2017)","journal-title":"Linear Algebra Appl."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.laa.2017.04.007","volume":"527","author":"VY Pan","year":"2017","unstructured":"Pan, V.Y., Zhao, L.: Numerically safe Gaussian elimination with no pivoting. Linear Algebra Appl. 527, 349\u2013383 (2017)","journal-title":"Linear Algebra Appl."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T19:32:21Z","timestamp":1695929541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_10","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":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"66","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":"22","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":"14","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":"33% - 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,1","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":"5,8","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}