{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:02:40Z","timestamp":1725516160730},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693864"},{"type":"electronic","value":"9783540693871"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69387-1_48","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:38:34Z","timestamp":1217471914000},"page":"426-435","source":"Crossref","is-referenced-by-count":0,"title":["Bound for the L 2 Norm of Random Matrix and Succinct Matrix Approximation"],"prefix":"10.1007","author":[{"given":"Rong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nian","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengxin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., McSherry, F.: Fast Computation of Low Rank Matrix Approximations. In: STOC 2001: Proceedings of the 32nd annual ACM symposium on Theory of computing, pp. 611\u2013618 (2001)","DOI":"10.1145\/380752.380858"},{"key":"48_CR2","unstructured":"Alon, N., Krivelevich, M., Vu, V.H.: On the Concentration of Eigenvalues of Random Symmetric Matrices. Tech. Report 60, Microsoft Research (2000)"},{"key":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11830924_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Arora","year":"2006","unstructured":"Arora, S., Hazan, E., Kale, S.: A Fast Random Sampling Algorithm for Sparsifying Matrices. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 272\u2013279. Springer, Heidelberg (2006)"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/1037127","volume":"37","author":"M. Berry","year":"1995","unstructured":"Berry, M., Dumais, S., O\u2019Brie, G.: Using Linear Algebra for Intelligent Information Retrieval. SIAM Review\u00a037, 573\u2013595 (1995)","journal-title":"SIAM Review"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z.: Sampling Lower Bounds via Information Theory. In: Proceedings of the 35th annual ACM symposium on Theory of computing, pp. 335\u2013344 (2003)","DOI":"10.1145\/780542.780593"},{"key":"48_CR6","volume-title":"Matrix Theories","author":"Y.P. Chen","year":"1998","unstructured":"Chen, Y.P.: Matrix Theories, 2nd edn. NorthWestern Polytechnical University Press, Xian (1998)","edition":"2"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S., Furnas, G., Landauer, T., Harshman, R.: Indexing by Latent Semantic Anlysis. J. American Society for information science\u00a041, 391\u2013407 (1990)","journal-title":"J. American Society for information science"},{"key":"48_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/11830924_28","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Deshpande","year":"2006","unstructured":"Deshpande, A., Vempala, S.: Adaptive Sampling and Fast Low-Rank Matrix Approximation. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 292\u2013303. Springer, Heidelberg (2006)"},{"key":"48_CR9","unstructured":"Drineas, P., Frieze, A., Kannan, R., Vempala, S., Vinay, V.: Clustering in large graphs and matrices. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 291\u2013299 (1999)"},{"issue":"2","key":"48_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/rsa.20089","volume":"27","author":"U. Feige","year":"2005","unstructured":"Feige, U., Ofek, E.: Spectral Techniques Applied to Sparse random graphs. Random Structures and Algorithms\u00a027(2), 251\u2013275 (2005)","journal-title":"Random Structures and Algorithms"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast Monte-Carlo algorithms for finding low-rank approximations. In: 39th Annual Symposium on Foundations of Computer Science, pp. 370\u2013378 (1998)","DOI":"10.1109\/SFCS.1998.743487"},{"issue":"6","key":"48_CR12","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1145\/1039488.1039494","volume":"51","author":"A. Frieze","year":"2004","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast Monte-Carlo algorithms for finding low-rank approximations. Journal of the ACM\u00a051(6), 1025\u20131041 (2004)","journal-title":"Journal of the ACM"},{"key":"48_CR13","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Maryland (1996)","edition":"3"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Mannila, H.: Local and Global Methods in Data Mining: Basic Techniques and Open Problems. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, pp. 57\u201368 (2002)","DOI":"10.1007\/3-540-45465-9_6"},{"key":"48_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21736-9","volume-title":"All of Statistics: A Concise Course in Statistical Inference","author":"L. Wasserman","year":"2004","unstructured":"Wasserman, L.: All of Statistics: A Concise Course in Statistical Inference. Springer, New York (2004)"},{"issue":"1-3","key":"48_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10994-005-3561-6","volume":"61","author":"J.P. Ye","year":"2005","unstructured":"Ye, J.P.: Generalized Low Rank Matrix Approximations of Matrices. Machine Learning\u00a061(1-3), 167\u2013191 (2005)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69387-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T06:10:26Z","timestamp":1551507026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69387-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693864","9783540693871"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69387-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}