{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T04:18:08Z","timestamp":1728706688933},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T00:00:00Z","timestamp":1673481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11227-022-05039-5","type":"journal-article","created":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T02:02:23Z","timestamp":1673488943000},"page":"9350-9366","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving empirical efficiency of CUR decomposition"],"prefix":"10.1007","volume":"79","author":[{"given":"Mostafa","family":"Haghir Chehreghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zahra","family":"Yaghoobi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,12]]},"reference":[{"key":"5039_CR1","unstructured":"Worldometers 09\u00a0June 2020. Countries in the world by population, 2020"},{"key":"5039_CR2","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"Leman Akoglu","year":"2015","unstructured":"Akoglu L, Tong H, Koutra D (2015) Graph-based anomaly detection and description: a survey. Data Min Knowl Discov 29:626\u2013688","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"2","key":"5039_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/140977898","volume":"46","author":"Christos Boutsidis","year":"2017","unstructured":"Boutsidis C, Woodruff David P (2017) Optimal CUR matrix decompositions. SIAM J Comput 46(2):543\u2013589","journal-title":"SIAM J Comput"},{"key":"5039_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/LSP.2020.3044130","volume":"28","author":"HanQin Cai","year":"2021","unstructured":"Cai H, Hamm K, Huang L, Li J, Wang T (2021) Rapid robust principal component analysis: CUR accelerated inexact low rank estimation. IEEE Signal Process Lett 28:116\u2013120","journal-title":"IEEE Signal Processing Letters"},{"issue":"4","key":"5039_CR5","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 Imag Sci 14(4):1472\u20131503","journal-title":"SIAM J Imag Sci"},{"key":"5039_CR6","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s E, Recht B (2012) Exact matrix completion via convex optimization. Commun ACM 55(6):111\u2013119","DOI":"10.1145\/2184319.2184343"},{"issue":"3","key":"5039_CR7","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1137\/110852310","volume":"34","author":"J Chiu","year":"2013","unstructured":"Chiu J, Demanet L (2013) Sublinear randomized algorithms for skeleton decompositions. SIAM J Matrix Anal Appl 34(3):1361\u20131383","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"5039_CR8","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0097539704442702","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas P, Kannan R, Mahoney 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"},{"key":"5039_CR9","unstructured":"Dua D, Graff C (2017) UCI machine learning repository"},{"issue":"1","key":"5039_CR10","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 Algebr Appl 261(1):1\u201321","journal-title":"Linear Algebr Appl"},{"key":"5039_CR11","unstructured":"Guennebaud G, Jacob B et\u00a0al (2020) Eigen v 3.3.9. http:\/\/eigen.tuxfamily.org,"},{"issue":"3","key":"5039_CR12","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1016\/j.acha.2019.08.006","volume":"48","author":"K Hamm","year":"2020","unstructured":"Hamm Keaton, Huang Longxiu (2020) Perspectives on CUR decompositions. Appl Comput Harmonic Anal 48(3):1088\u20131099","journal-title":"Appl Comput Harmonic Anal"},{"issue":"2","key":"5039_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.3934\/fods.2020006","volume":"2","author":"K Hamm","year":"2020","unstructured":"Hamm K, Huang L (2020) Stability of sampling for CUR decompositions. Found Data Sci 2(2):83\u201399","journal-title":"Found Data Sci"},{"issue":"6","key":"5039_CR14","doi-asserted-by":"publisher","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","volume":"56","author":"RH Keshavan","year":"2010","unstructured":"Keshavan RH, Montanari A, Sewoong Oh (2010) Matrix completion from a few entries. IEEE Trans Inf Theor 56(6):2980\u20132998","journal-title":"IEEE Trans Inf Theor"},{"key":"5039_CR15","unstructured":"Khetan A, Oh S (2017) Matrix norm estimation from a few entries. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, pages 6424\u20136433"},{"issue":"2","key":"5039_CR16","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/TAC.1980.1102314","volume":"25","author":"V Klema","year":"1980","unstructured":"Klema V, Laub A (1980) The singular value decomposition: its computation and some applications. IEEE Trans Autom Control 25(2):164\u2013176","journal-title":"IEEE Trans Autom Control"},{"key":"5039_CR17","unstructured":"Li Yi, Woodruff David P(2020) Input-sparsity low rank approximation in schatten norm. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event, pages 6001\u20136009"},{"key":"5039_CR18","unstructured":"Li Yi, Woodruff David P (2022) Tight bounds for sketching the operator norm, schatten norms, and subspace embeddings. CoRR, abs\/2202.09797"},{"issue":"3","key":"5039_CR19","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney Michael W, Drineas Petros (2009) CUR matrix decompositions for improved data analysis. Proc Nat Acad Sci 106(3):697\u2013702","journal-title":"Proc Nat Acad Sci"},{"key":"5039_CR20","doi-asserted-by":"crossref","unstructured":"Mitrovic N, Asif Muhammad T, Rasheed U, Dauwels J, Jaillet P (2013) CUR decomposition for compression and compressed sensing of large-scale traffic data. In 16th International IEEE Conference on Intelligent Transportation Systems, ITSC 2013, The Hague, The Netherlands, October 6-9, 2013, pages 1475\u20131480. IEEE","DOI":"10.1109\/ITSC.2013.6728438"},{"key":"5039_CR21","doi-asserted-by":"crossref","unstructured":"Song Z, Woodruff David P, Zhong P (2017) Low rank approximation with entrywise l$${}_{\\text{1}}$$-norm error. In STOC, pages 688\u2013701. ACM","DOI":"10.1145\/3055399.3055431"},{"key":"5039_CR22","doi-asserted-by":"crossref","unstructured":"Song Z, Woodruff DP, Zhong P (2019) Relative error tensor low rank approximation. In SODA, pages 2772\u20132789. SIAM","DOI":"10.1137\/1.9781611975482.172"},{"issue":"1","key":"5039_CR23","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1002\/sam.102","volume":"1","author":"J Sun","year":"2008","unstructured":"Sun J, Xie Y, Zhang H, Faloutsos C (2008) Less is more: sparse graph mining with compact matrix decomposition. Stat Anal Data Min 1(1):6\u201322","journal-title":"Stat Anal Data Min"},{"issue":"3","key":"5039_CR24","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 PG (2017) Efficient algorithms for CUR and interpolative matrix decompositions. Adv Comput Math 43(3):495\u2013516","journal-title":"Adv. Comput. Math."},{"issue":"1","key":"5039_CR25","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"},{"key":"5039_CR26","unstructured":"Williams Christopher KI, Seeger M (2001) Using the nystr\u00f6m method to speed up kernel machines. In T.K. Leen, T.G. Dietterich, and V.\u00a0Tresp, editors, Advances in Neural Information Processing Systems 13 (NIPS 2000), pages 682\u2013688. MIT Press"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-05039-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-05039-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-05039-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T01:13:40Z","timestamp":1728695620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-05039-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,12]]},"references-count":26,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["5039"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-05039-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2023,1,12]]},"assertion":[{"value":"29 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2023","order":2,"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 competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}