{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:35:17Z","timestamp":1770896117228,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540380443","type":"print"},{"value":"9783540380450","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11830924_30","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T12:33:54Z","timestamp":1156509234000},"page":"316-326","source":"Crossref","is-referenced-by-count":35,"title":["Subspace Sampling and Relative-Error Matrix Approximation: Column-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":"30_CR1","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":"30_CR2","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":"30_CR3","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Vempala, S.: Adaptive sampling and fast low-rank matrix approximation. Technical Report TR06-042, Electronic Colloquium on Computational Complexity (March 2006)","DOI":"10.1007\/11830924_28"},{"key":"30_CR4","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)"},{"key":"30_CR5","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":"30_CR6","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":"30_CR7","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":"30_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":"30_CR9","doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Sampling algorithms for \u2113. 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":"30_CR10","doi-asserted-by":"crossref","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast Monte-Carlo algorithms for finding low-rank approximations. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 370\u2013378 (1998)","DOI":"10.1109\/SFCS.1998.743487"},{"issue":"6","key":"30_CR11","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":"30_CR12","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":"30_CR13","unstructured":"Har-Peled, S.: Low rank matrix approximation in linear time (manuscript, January 2006)"},{"key":"30_CR14","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":"30_CR15","doi-asserted-by":"crossref","unstructured":"Kuruvilla, F.G., Park, P.J., Schreiber, S.L.: Vector algebra in the analysis of genome-wide expression data. Genome Biology, 3: research 0011.1\u20130011.11 (2002)","DOI":"10.1186\/gb-2002-3-3-research0011"},{"key":"30_CR16","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"},{"key":"30_CR17","volume-title":"Generalized Inverses and Applications","year":"1976","unstructured":"Nashed, M.Z. (ed.): Generalized Inverses and Applications. Academic Press, New York (1976)"},{"key":"30_CR18","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":"30_CR19","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":"30_CR20","unstructured":"Rudelson, M., Vershynin, R.: Approximation of matrices (manuscript)"},{"key":"30_CR21","unstructured":"Vershynin, R.: Coordinate restrictions of linear operators in $l_2^n$ (manuscript)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11830924_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:18:33Z","timestamp":1605644313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11830924_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380443","9783540380450"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11830924_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}