{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:29Z","timestamp":1763467769380},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_29","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"304-314","source":"Crossref","is-referenced-by-count":17,"title":["Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods"],"prefix":"10.1007","author":[{"given":"Petros","family":"Drineas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael W.","family":"Mahoney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Berry, M.W., Pulatova, S.A., Stewart, G.W.: Computing sparse reduced-rank approximations to sparse matrices. Technical Report UMIACS TR-2004-32 CMSC TR-4589, University of Maryland, College Park, MD (2004)"},{"key":"29_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R. Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, New York (1997)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Rademacher, L., Vempala, S., Wang, G.: Matrix approximation and projective clustering via volume sampling. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1117\u20131126 (2006)","DOI":"10.1145\/1109557.1109681"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication. SIAM Journal on Computing (to appear)","DOI":"10.1137\/S0097539704442684"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix. SIAM Journal on Computing (to appear)","DOI":"10.1137\/S0097539704442696"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition. SIAM Journal on Computing (to appear)","DOI":"10.1137\/S0097539704442702"},{"key":"29_CR7","first-page":"2153","volume":"6","author":"P. Drineas","year":"2005","unstructured":"Drineas, P., Mahoney, M.W.: On the Nystr\u00f6m method for approximating a Gram matrix for improved kernel-based learning. Journal of Machine Learning Research\u00a06, 2153\u20132175 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"29_CR8","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Polynomial time algorithm for column-row based relative-error low-rank matrix approximation. Technical Report 2006-04, DIMACS (March 2006)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Sampling algorithms for \u21132. regression and applications. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1127\u20131136 (2006)","DOI":"10.1145\/1109557.1109682"},{"key":"29_CR10","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins University Press, Baltimore (1989)"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/conm\/280\/4620","volume":"280","author":"S.A. Goreinov","year":"2001","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E.: The maximum-volume concept in approximation by low-rank matrices. Contemporary Mathematics\u00a0280, 47\u201351 (2001)","journal-title":"Contemporary Mathematics"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00301-1","volume":"261","author":"S.A. Goreinov","year":"1997","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: A theory of pseudoskeleton approximations. Linear Algebra and Its Applications\u00a0261, 1\u201321 (1997)","journal-title":"Linear Algebra and Its Applications"},{"key":"29_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, New York (1985)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2002-3-3-research0011","volume":"3","author":"F.G. Kuruvilla","year":"2002","unstructured":"Kuruvilla, F.G., Park, P.J., Schreiber, S.L.: Vector algebra in the analysis of genome-wide expression data. Genome Biology\u00a03, 0011.1\u20130011.11 (2002)","journal-title":"Genome Biology"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1086\/425587","volume":"75","author":"Z. Lin","year":"2004","unstructured":"Lin, Z., Altman, R.B.: Finding haplotype tagging SNPs by use of principal components analysis. American Journal of Human Genetics\u00a075, 850\u2013861 (2004)","journal-title":"American Journal of Human Genetics"},{"volume-title":"Generalized Inverses and Applications","year":"1976","key":"29_CR16","unstructured":"Nashed, M.Z. (ed.): Generalized Inverses and Applications. Academic Press, New York (1976)"},{"key":"29_CR17","unstructured":"Paschou, P., Mahoney, M.W., Kidd, J.R., Pakstis, A.J., Gu, S., Kidd, K.K., Drineas, P.: Intra- and inter-population genotype reconstruction from tagging SNPs (manuscript submitted for publication)"},{"key":"29_CR18","unstructured":"Rademacher, L., Vempala, S., Wang, G.: Matrix approximation and projective clustering via iterative sampling. Technical Report MIT-LCS-TR-983, Massachusetts Institute of Technology, Cambridge, MA (March 2005)"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s002110050451","volume":"83","author":"G.W. Stewart","year":"1999","unstructured":"Stewart, G.W.: Four algorithms for the efficient computation of truncated QR approximations to a sparse matrix. Numerische Mathematik\u00a083, 313\u2013323 (1999)","journal-title":"Numerische Mathematik"},{"key":"29_CR20","unstructured":"Stewart, G.W.: Error analysis of the quasi-Gram-Schmidt algorithm. Technical Report UMIACS TR-2004-17 CMSC TR-4572, University of Maryland, College Park, MD (2004)"},{"key":"29_CR21","unstructured":"Williams, C.K.I., Seeger, M.: Using the Nystr\u00f6m method to speed up kernel machines. In: Annual Advances in Neural Information Processing Systems 13: Proceedings of the 2000 Conference, pp. 682\u2013688 (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:40:29Z","timestamp":1605642029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11841036_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}