The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
CUR matrix decompositions for improved data analysis
Open accessAbstract
Principal components analysis and, more generally, the Singular Value Decomposition are fundamental data analysis tools that express a data matrix in terms of a sequence of orthogonal or uncorrelated vectors of decreasing importance. Unfortunately, being linear combinations of up to all the data points, these vectors are notoriously difficult to interpret in terms of the data and processes generating the data. In this article, we develop CUR matrix decompositions for improved data analysis. CUR decompositions are low-rank matrix decompositions that are explicitly expressed in terms of a small number of actual columns and/or actual rows of the data matrix. Because they are constructed from actual data elements, CUR decompositions are interpretable by practitioners of the field from which the data are drawn (to the extent that the original data are). We present an algorithm that preferentially chooses columns and rows that exhibit high “statistical leverage” and, thus, in a very precise statistical sense, exert a disproportionately large “influence” on the best low-rank fit of the data matrix. By selecting columns and rows in this manner, we obtain improved relative-error and constant-factor approximation guarantees in worst-case analysis, as opposed to the much coarser additive-error guarantees of prior work. In addition, since the construction involves computing quantities with a natural and widely studied statistical interpretation, we can leverage ideas from diagnostic regression analysis to employ these matrix decompositions for exploratory data analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Proceedings of the 24th international conference on Machine learning
(2007) · doi:10.1145/1273496 · Cited by 11,630
(1996) · Choice Reviews Online · doi:10.5860/choice.34-2458 · Cited by 3,732
Regression Analysis by Example.
Kmenta, J., Chatterjee, S., & Price, B. (1980) · Journal of the American Statistical Association · doi:10.2307/2287213 · Cited by 3,198
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90038-5 · Cited by 2,437
A Genome-Wide Transcriptional Analysis of the Mitotic Cell Cycle
Cho, R. J., Campbell, M. J., Winzeler, E. A., Steinmetz, L., Conway, A., Wodicka, L., Wolfsberg, T. G., Gabrielian, A. E., Landsman, D., Lockhart, D. J., et al. (1998) · Molecular Cell · doi:10.1016/s1097-2765(00)80114-8 · Cited by 2,046
Singular value decomposition for genome-wide expression data processing and modeling
Alter, O., Brown, P. O., & Botstein, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.18.10101 · Cited by 1,971
Bogaevski, V. N., & Povzner, A. (1991) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-4438-7_1 · Cited by 1,384
Singular Value Decomposition and Principal Component Analysis
Wall, M. E., Rechtsteiner, A., & Rocha, L. M. (2005) · A Practical Approach to Microarray Data Analysis · doi:10.1007/0-306-47815-3_5 · Cited by 1,215
The Enron Corpus: A New Dataset for Email Classification Research
Klimt, B., & Yang, Y. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30115-8_22 · Cited by 1,157
The Hat Matrix in Regression and ANOVA
Hoaglin, D. C., & Welsch, R. E. (1978) · The American Statistician · doi:10.1080/00031305.1978.10479237 · Cited by 912
Influential Observations, High Leverage Points, and Outliers in Linear Regression
Chatterjee, S., & Hadi, A. S. (1986) · Statistical Science · doi:10.1214/ss/1177013622 · Cited by 826
Patterns of Congressional Voting
Poole, K. T., & Rosenthal, H. (1991) · American Journal of Political Science · doi:10.2307/2111445 · Cited by 777
Sensitivity Analysis in Linear Regression.
Nuamah, N. N. N. N., Chatterjee, S., & Hadi, A. S. (1989) · The Statistician · doi:10.2307/2348320 · Cited by 589
Molecular characterisation of soft tissue tumours: a gene expression study
Nielsen, T. O., West, R. B., Linn, S. C., Alter, O., Knowling, M. A., O'Connell, J. X., Zhu, S., Fero, M., Sherlock, G., Pollack, J. R., et al. (2002) · The Lancet · doi:10.1016/s0140-6736(02)08270-3 · Cited by 576
Regression Analysis by Example
SRJ, Chatterjee, S., Hadi, A. S., & Price, B. (2000) · Journal of the American Statistical Association · doi:10.2307/2669806 · Cited by 574
Sensitivity Analysis in Linear Regression
Chatterjee, S., & Hadi, A. S. (1988) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316764 · Cited by 502
Fast monte-carlo algorithms for finding low-rank approximations
Frieze, A., Kannan, R., & Vempala, S. (2004) · Journal of the ACM · doi:10.1145/1039488.1039494 · Cited by 500
A theory of pseudoskeleton approximations
Goreinov, S. A., Tyrtyshnikov, E. E., & Замарашкин, Н. Л. (1997) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(96)00301-1 · Cited by 498
Fundamental patterns underlying gene expression profiles: Simplicity from complexity
Holter, N. S., Mitra, M., Maritan, A., Cieplak, M., Banavar, J. R., & Fedoroff, N. V. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.150242097 · Cited by 476
Relative-Error $CUR$ Matrix Decompositions
Drineas, P., Mahoney, M. W., & Muthukrishnan, S. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07070471x · Cited by 461
Self-citationSensitivity Analysis in Linear Regression.
Thomas, W., Chatterjee, S., & Hadi, A. S. (1989) · Journal of the American Statistical Association · doi:10.2307/2289957 · Cited by 406
Generalized Inverses and Applications
(1976) · Elsevier eBooks · doi:10.1016/c2013-0-11227-5 · Cited by 387
Efficient Computing of Regression Diagnostics
Velleman, P. F., & Welsch, R. E. (1981) · The American Statistician · doi:10.1080/00031305.1981.10479362 · Cited by 367
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442702 · Cited by 310
Self-citationA network analysis of committees in the U.S. House of Representatives
Porter, M. A., Mucha, P. J., Newman, M. E. J., & Warmbrand, C. M. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500191102 · Cited by 214
Gabrilovich, E., & Markovitch, S. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015388 · Cited by 199
From paragraph to graph: Latent semantic analysis for information visualization
Landauer, T. K., Laham, D., & Derr, M. A. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400341101 · Cited by 147
Vector algebra in the analysis of genome-wide expression data
Kuruvilla, F. G., Park, P. J., & Schreiber, S. L. (2002) · Genome biology · doi:10.1186/gb-2002-3-3-research0011 · Cited by 70
Beloff, H. (1996) · Behaviour Research and Therapy · doi:10.1016/0005-7967(96)89810-x · Cited by 3
Cited by
Halko, N., Martinsson, P. G., & Tropp, J. A. (2011) · SIAM Review · doi:10.1137/090771806 · Cited by 4,002
Challenges of Big Data analysis
Fan, J., Han, F., & Liu, H. (2014) · National Science Review · doi:10.1093/nsr/nwt032 · Cited by 1,482
Gaussian Process Regression for Materials and Molecules
Deringer, V. L., Bartók, A. P., Bernstein, N., Wilkins, D. M., Ceriotti, M., & Csányi, G. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00022 · Cited by 1,221
Computational Advertising: Techniques for Targeting Relevant Ads
Woodruff, D. P. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000060 · Cited by 866
Combining Machine Learning and Computational Chemistry for Predictive Insights Into Chemical Systems
Keith, J. A., Vassilev-Galindo, V., Cheng, B., Chmiela, S., Gastegger, M., Müller, K.-R., & Tkatchenko, A. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00107 · Cited by 849
Metadata
- Authors
- Mahoney, M. W., & Drineas, P.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2009-01-20
- Volume
- 106
- Issue
- 3
- Pages
- 697-702
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2141696759
- Cited by
- 773
- References
- 32
- FWCI
- 24.79
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.