{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:55:07Z","timestamp":1740142507690,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:00:00Z","timestamp":1711584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:00:00Z","timestamp":1711584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671060","12271108"],"award-info":[{"award-number":["11671060","12271108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012669","name":"Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission","doi-asserted-by":"publisher","award":["cstc2019jcyj-msxmX0267"],"award-info":[{"award-number":["cstc2019jcyj-msxmX0267"]}],"id":[{"id":"10.13039\/501100012669","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s40314-024-02642-5","type":"journal-article","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T11:01:39Z","timestamp":1711623699000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CPQR-based randomized algorithms for generalized CUR decompositions"],"prefix":"10.1007","volume":"43","author":[{"given":"Guihua","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5033-578X","authenticated-orcid":false,"given":"Hanyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yimin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,28]]},"reference":[{"issue":"9","key":"2642_CR1","doi-asserted-by":"publisher","first-page":"2525","DOI":"10.1016\/j.camwa.2016.09.014","volume":"72","author":"Y Aizenbud","year":"2016","unstructured":"Aizenbud Y, Shabat G, Averbuch A (2016) Randomized LU decomposition using sparse projections. Comput Math Appl 72(9):2525\u20132534","journal-title":"Comput Math Appl"},{"key":"2642_CR2","unstructured":"Anderson DG, Du SS, Mahoney MW, Melgaard C, Wu K, Gu M (2015) Spectral gap error bounds for improving CUR matrix decomposition and the Nystr\u00f6m method. In: Proceedings of the 18th International Conference on Artificial Intelligence and Statistics (AISTATS), vol 38, pp 19\u201327"},{"key":"2642_CR3","volume-title":"Generalized inverses: theory and applications","author":"A Ben-Israel","year":"2003","unstructured":"Ben-Israel A, Greville TNE (2003) Generalized inverses: theory and applications, 2nd edn. Springer Verlag, New York","edition":"2"},{"issue":"2","key":"2642_CR4","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/140977898","volume":"46","author":"C Boutsidis","year":"2017","unstructured":"Boutsidis C, Woodruff DP (2017) Optimal CUR matrix decompositions. SIAM J Comput 46(2):543\u2013589","journal-title":"SIAM J Comput"},{"issue":"2","key":"2642_CR5","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 (2014) Near-optimal column-based matrix reconstruction. SIAM J Comput 43(2):687\u2013717","journal-title":"SIAM J Comput"},{"issue":"4","key":"2642_CR6","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1137\/20M1388322","volume":"14","author":"H Cai","year":"2021","unstructured":"Cai H, Hamm K, Huang L, Needell D (2021) Robust CUR decomposition: theory and imaging applications. SIAM J Imaging Sci 14(4):1472\u20131503","journal-title":"SIAM J Imaging Sci"},{"key":"2642_CR7","unstructured":"Cao Z, Wei Y, Xie P (2023) Randomized GCUR decompositions. arXiv:2301.13163"},{"issue":"3","key":"2642_CR8","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1007\/s10957-022-02051-w","volume":"194","author":"M Che","year":"2022","unstructured":"Che M, Chen J, Wei Y (2022) Perturbations of the TCUR decomposition for tensor valued data in the tucker format. J Optim Theory Appl 194(3):852\u2013877","journal-title":"J Optim Theory Appl"},{"issue":"6","key":"2642_CR9","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1080\/01630563.2022.2056198","volume":"43","author":"J Chen","year":"2022","unstructured":"Chen J, Wei Y, Xu Y (2022) Tensor CUR decomposition under T-product and its perturbation. Numer Funct Anal Optim 43(6):698\u2013722","journal-title":"Numer Funct Anal Optim"},{"key":"2642_CR10","unstructured":"Chen C, Gu M, Zhang Z, Zhang W, Yu Y (2020) Efficient spectrum revealing CUR matrix decomposition. In: Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics (AISTATS), vol 108, pp 766\u2013775"},{"key":"2642_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s10444-023-10061-z","volume":"49","author":"Y Dong","year":"2023","unstructured":"Dong Y, Martinsson P-G (2023) Simpler is better: a comparative study of randomized algorithms for computing the CUR decomposition. Adv Comput Math 49:66","journal-title":"Adv Comput Math"},{"key":"2642_CR12","first-page":"12","volume":"6","author":"P Drineas","year":"2005","unstructured":"Drineas P, Mahoney MW (2005) On the Nystr\u00f6m method for approximating a gram matrix for improved kernel-based learning. J Mach Learn Res 6:12","journal-title":"J Mach Learn Res"},{"issue":"1","key":"2642_CR13","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0097539704442702","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas P, Kannan R, Michael MW (2006) Fast monte carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. SIAM J Comput 36(1):184\u2013206","journal-title":"SIAM J Comput"},{"issue":"2","key":"2642_CR14","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas P, Mahoney MW, Muthukrishnan S (2008) Relative-error CUR matrix decompositions. SIAM J Matrix Anal Appl 30(2):844\u2013881","journal-title":"SIAM J Matrix Anal Appl"},{"key":"2642_CR15","unstructured":"Drineas P, Kannan R (2003) Pass efficient algorithms for approximating large matrices. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, vol 3, pp 223\u2013232"},{"issue":"4","key":"2642_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1137\/15M1044680","volume":"39","author":"JA Duersch","year":"2017","unstructured":"Duersch JA, Gu M (2017) Randomized QR with column pivoting. SIAM J Sci Comput 39(4):263\u2013291","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"2642_CR17","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/20M1335571","volume":"62","author":"JA Duersch","year":"2020","unstructured":"Duersch JA, Gu M (2020) Randomized projection for rank-revealing matrix factorizations and low-rank approximations. SIAM Rev 62(3):661\u2013682","journal-title":"SIAM Rev"},{"key":"2642_CR18","doi-asserted-by":"crossref","unstructured":"Gidisu PY, Hochstenbach ME (2022) RSVD-CUR decomposition for matrix triplets. arXiv:2204.02113","DOI":"10.1137\/22M1500666"},{"key":"2642_CR19","first-page":"147","volume":"2021","author":"PY Gidisu","year":"2022","unstructured":"Gidisu PY, Hochstenbach ME (2022) A hybrid DEIM and leverage scores based method for CUR index selection. Progr Ind Math ECMI 2021:147\u2013153","journal-title":"Progr Ind Math ECMI"},{"issue":"1","key":"2642_CR20","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1137\/21M1432119","volume":"4","author":"PY Gidisu","year":"2022","unstructured":"Gidisu PY, Hochstenbach ME (2022) A generalized CUR decomposition for matrix pairs. SIAM J Math Data Sci 4(1):386\u2013409","journal-title":"SIAM J Math Data Sci"},{"key":"2642_CR21","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944","volume-title":"Matrix computations","author":"GH Golub","year":"2013","unstructured":"Golub GH, Van Loan CF (2013) Matrix computations, 4th edn. Johns Hopkins University Press, Baltimore, MD","edition":"4"},{"issue":"1\u20133","key":"2642_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00301-1","volume":"261","author":"SA Goreinov","year":"1997","unstructured":"Goreinov SA, Tyrtyshnikov EE, Zamarashkin NL (1997) A theory of pseudoskeleton approximations. Linear Algebra Appl 261(1\u20133):1\u201321","journal-title":"Linear Algebra Appl"},{"issue":"2","key":"2642_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko N, Martinsson P-G, Tropp JA (2011) Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev 53(2):217\u2013288","journal-title":"SIAM Rev"},{"issue":"1","key":"2642_CR24","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/19M128394X","volume":"42","author":"K Hamm","year":"2021","unstructured":"Hamm K, Huang L (2021) Perturbations of CUR decompositions. SIAM J Matrix Anal Appl 42(1):351\u2013375","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"2642_CR25","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1080\/00207160.2022.2141571","volume":"100","author":"H Lei","year":"2023","unstructured":"Lei H, Liu J, Yu Y (2023) Exemplar-based large scale low-rank matrix decomposition for collaborative prediction. Int J Comput Math 100(3):615\u2013640","journal-title":"Int J Comput Math"},{"issue":"3","key":"2642_CR26","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney MW, Drineas P (2009) CUR matrix decompositions for improved data analysis. Proc Natl Acad Sci USA 106(3):697\u2013702","journal-title":"Proc Natl Acad Sci USA"},{"key":"2642_CR27","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/S0962492920000021","volume":"29","author":"P-G Martinsson","year":"2020","unstructured":"Martinsson P-G, Tropp JA (2020) Randomized numerical linear algebra: foundations and algorithms. Acta Numer 29:403\u2013572","journal-title":"Acta Numer"},{"issue":"2","key":"2642_CR28","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/16M1081270","volume":"39","author":"P-G Martinsson","year":"2017","unstructured":"Martinsson P-G, Quintana Ort\u00cd G, Heavner N, van de Geijn R (2017) Householder QR factorization with randomization for column pivoting (HQRRP). SIAM J Sci Comput 39(2):96\u2013115","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"2642_CR29","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1137\/140978430","volume":"38","author":"DC Sorensen","year":"2016","unstructured":"Sorensen DC, Embree M (2016) A DEIM induced CUR factorization. SIAM J Sci Comput 38(3):1454\u20131482","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"2642_CR30","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1137\/0713009","volume":"13","author":"CF Van Loan","year":"1976","unstructured":"Van Loan CF (1976) Generalizing the singular value decomposition. SIAM J Numer Anal 13(1):76\u201383","journal-title":"SIAM J Numer Anal"},{"issue":"4","key":"2642_CR31","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/BF01389653","volume":"46","author":"C Van Loan","year":"1985","unstructured":"Van Loan C (1985) Computing the CS and the generalized singular value decompositions. Numer Math 46(4):479\u2013491","journal-title":"Numer Math"},{"issue":"3","key":"2642_CR32","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10444-016-9494-8","volume":"43","author":"S Voronin","year":"2017","unstructured":"Voronin S, Martinsson P-G (2017) Efficient algorithms for CUR and interpolative matrix decompositions. Adv Comput Math 43(3):495\u2013516","journal-title":"Adv Comput Math"},{"issue":"1","key":"2642_CR33","first-page":"2729","volume":"14","author":"S Wang","year":"2013","unstructured":"Wang S, Zhang Z (2013) Improving CUR matrix decomposition and the nystr\u00f6m approximation via adaptive sampling. J Mach Learn Res 14(1):2729\u20132769","journal-title":"J Mach Learn Res"},{"issue":"1","key":"2642_CR34","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s42967-020-00061-x","volume":"3","author":"W Wei","year":"2021","unstructured":"Wei W, Zhang H, Yang X, Chen X (2021) Randomized generalized singular value decomposition. Commun Appl Math Comput 3(1):137\u2013156","journal-title":"Commun Appl Math Comput"},{"key":"2642_CR35","unstructured":"Woodruff DP (2014) Sketching as a tool for numerical linear algebra. Found Trends\u00ae Theor Comput Sci 10(1-2):1\u2013157"},{"issue":"1","key":"2642_CR36","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/0612014","volume":"12","author":"H Zha","year":"1991","unstructured":"Zha H (1991) The restricted singular value decomposition of matrix triplets. SIAM J Matrix Anal Appl 12(1):172\u2013194","journal-title":"SIAM J Matrix Anal Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02642-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02642-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02642-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T05:20:21Z","timestamp":1712553621000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02642-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,28]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2642"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02642-5","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2024,3,28]]},"assertion":[{"value":"30 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"132"}}