乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T06:03:01Z","timestamp":1705903381324},"reference-count":38,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T00:00:00Z","timestamp":1601424000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Numerical Linear Algebra App"],"published-print":{"date-parts":[[2021,1]]},"abstract":"Summary<\/jats:title>High\u2010dimensionality reduction techniques are very important tools in machine learning and data mining. The method of generalized low rank approximations of matrices (GLRAM) is a popular technique for dimensionality reduction and image compression. However, it suffers from heavily computational overhead in practice, especially for data with high dimension. In order to reduce the cost of this algorithm, we propose a randomized GLRAM algorithm based on randomized singular value decomposition (RSVD). The theoretical contribution of our work is threefold. First, we discuss the decaying property of singular values of the matrices during iterations of the GLRAM algorithm, and provide a target rank required in the RSVD process from a theoretical point of view. Second, we establish the relationship between the reconstruction errors generated by the standard GLRAM algorithm and the randomized GLRAM algorithm. It is shown that the reconstruction errors generated by the former and the latter are comparable, even if the solutions are computed inaccurately during iterations. Third, the convergence of the randomized GLRAM algorithm is investigated. Numerical experiments on some real\u2010world data sets illustrate the superiority of our proposed algorithm over its original counterpart and some state\u2010of\u2010the\u2010art GLRAM\u2010type algorithms.<\/jats:p>","DOI":"10.1002\/nla.2338","type":"journal-article","created":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T19:41:49Z","timestamp":1601494909000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A randomized generalized low rank approximations of matrices algorithm for high dimensionality reduction and image compression"],"prefix":"10.1002","volume":"28","author":[{"given":"Ke","family":"Li","sequence":"first","affiliation":[{"name":"School of Mathematics China University of Mining and Technology Xuzhou P.R. China"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4936-437X","authenticated-orcid":false,"given":"Gang","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Mathematics China University of Mining and Technology Xuzhou P.R. China"}]}],"member":"311","published-online":{"date-parts":[[2020,9,30]]},"reference":[{"key":"e_1_2_7_2_1","volume-title":"Introduction to statistical pattern classification","author":"Fukunaga K","year":"1990"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.41390"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1261097"},{"key":"e_1_2_7_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.1991.3.1.71"},{"key":"e_1_2_7_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2005.06.004"},{"key":"e_1_2_7_7_1","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.micpro.2016.06.011","article-title":"The improved (2D)2PCA algorithm and its parallel implementation based on image block","volume":"47","author":"Song H","year":"2016","journal-title":"Microprocess Microsyst"},{"key":"e_1_2_7_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-3561-6"},{"key":"e_1_2_7_9_1","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TNN.2010.2040290","article-title":"Generalized low rank approximations of matrices revisited","volume":"21","author":"Liu J","year":"2010","journal-title":"IEEE Trans Neural Netw"},{"key":"e_1_2_7_10_1","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1016\/j.patrec.2005.11.013","article-title":"Non\u2010iterative generalized low rank approximation of matrices","volume":"27","author":"Liu J","year":"2006","journal-title":"Pattern Recogn Lett"},{"key":"e_1_2_7_11_1","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.neucom.2007.11.046","article-title":"A simplified GLRAM algorithm for face recognition","volume":"72","author":"Lu C","year":"2008","journal-title":"Neurocomputing"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.04.029"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.024"},{"key":"e_1_2_7_14_1","doi-asserted-by":"crossref","unstructured":"NakouriH LimamM. Robust generalized low rank approximation of matrices for image recognition. Paper presented at: Proceedings of the IEEE International Symposium on Signal Processing and Information Technology(ISSPIT); Limassol Cyprus:2016:203\u2010207.","DOI":"10.1109\/ISSPIT.2016.7886035"},{"key":"e_1_2_7_15_1","doi-asserted-by":"crossref","unstructured":"InoueK HaraK UrahamaK. Symmetric generalized low rank approximations of matrices. Paper presented at: Proceedings of the IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP); Kyoto Japan 2012. p. 949\u2010952.","DOI":"10.1109\/ICASSP.2012.6288042"},{"key":"e_1_2_7_16_1","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1016\/j.patcog.2006.04.038","article-title":"The theoretical analysis of GLRAM and its applications","volume":"40","author":"Liang Z","year":"2007","journal-title":"Pattern Recognit"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/130938700"},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"e_1_2_7_19_1","doi-asserted-by":"crossref","unstructured":"LibertyE WoolfeF MartinssonP RokhlinV TygertM. Randomized algorithms for the low\u2010rank approximation of matrices. Proceedings of the National Academy of Sciences of the United States of America; vol 104;2007. p. 20167\u201320172.","DOI":"10.1073\/pnas.0709640104"},{"key":"e_1_2_7_20_1","unstructured":"MartinssonP. Randomized methods for matrix computations and analysis of high dimensional data;2016. arXiv:1607.01649."},{"key":"e_1_2_7_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.02.003"},{"key":"e_1_2_7_22_1","doi-asserted-by":"crossref","unstructured":"BinghamE MannilaH. Random projection in dimensionality reduction: applications to image and text data. Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining; San Francisco California 2001 p. 245\u2013250.","DOI":"10.1145\/502512.502546"},{"key":"e_1_2_7_23_1","first-page":"1","article-title":"Adaptive randomized dimension reduction on massive data","volume":"18","author":"Darnell G","year":"2017","journal-title":"J Mach Learn Res"},{"key":"e_1_2_7_24_1","first-page":"426","article-title":"Face recognition experiments with random projection","volume":"5779","author":"Goel N","year":"2005","journal-title":"Biometr Technol Human Identificat II"},{"key":"e_1_2_7_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898334605"},{"key":"e_1_2_7_26_1","volume-title":"Matrix computations","author":"Golub GH","year":"2014"},{"key":"e_1_2_7_27_1","first-page":"1396","volume-title":"Advances in neural information processing systems, Neural Information Processing Systems (NIPS), 10010 North Torrey Pines RD","author":"Musco C","year":"2015"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"e_1_2_7_29_1","unstructured":"ShiW WuG. A randomized algorithm for trace\u2010ratio problem with applications to high\u2010dimension and large\u2010sample data dimensionality reduction. Machine Learning revised."},{"key":"e_1_2_7_30_1","unstructured":"WrightJ GaneshA YangA ZhouZ MaY. Sparsity and robustness in face recognition;2011. arXiv:1111.1014v1."},{"key":"e_1_2_7_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.08.020"},{"key":"e_1_2_7_32_1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01418329","article-title":"The perturbation bounds for eigenspaces of a definite matrix\u2010pair","volume":"41","author":"Sun J","year":"1983","journal-title":"Numerische Mathematik"},{"key":"e_1_2_7_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"},{"key":"e_1_2_7_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2016.2601622"},{"key":"e_1_2_7_35_1","unstructured":"LyonsM AkamatsuS KamachiM GyobaJ. Coding facial expressions with Gabor Wavelets. Proceedings of the 3rd IEEE International Conference on Automatic Face and Gesture Recognition; Nara Japan:1998. p. 200\u2013205."},{"key":"e_1_2_7_36_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical algorithms for large eigenvalus problems","author":"Saad Y","year":"2011"},{"key":"e_1_2_7_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1251154"},{"key":"e_1_2_7_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_2_7_39_1","doi-asserted-by":"crossref","unstructured":"CaiD HeX ZhangW HanJ. Regularized locality preserving indexing via spectral regression. Proceedings of the 16th ACM Conference on Conference on Information and Knowledge Management (CIKM'07); Lisbon Portugal:2007. p. 741\u2013750.","DOI":"10.1145\/1321440.1321544"}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.2338","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/nla.2338","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.2338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T07:13:57Z","timestamp":1693811637000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nla.2338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,30]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1002\/nla.2338"],"URL":"https:\/\/doi.org\/10.1002\/nla.2338","archive":["Portico"],"relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,30]]},"assertion":[{"value":"2019-06-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-08-31","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}