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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
A Comprehensive Survey on Graph Anomaly Detection With Deep Learning
Ma, X., Wu, J., Xue, S., Yang, J., Zhou, C., Sheng, Q. Z., Xiong, H., & Akoglu, L. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3118815 · Cited by 835
On-the-fly machine learning force field generation: Application to melting points
Jinnouchi, R., Karsai, F., & Kresse, G. (2019) · Physical Review B · doi:10.1103/physrevb.100.014105 · Cited by 680
Machine learning based interatomic potential for amorphous carbon
Deringer, V. L., & Csányi, G. (2017) · Physical Review B · doi:10.1103/physrevb.95.094203 · Cited by 669
Jinnouchi, R., Lahnsteiner, J., Karsai, F., Kresse, G., & Bokdam, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.225701 · Cited by 635
Big-Data Science in Porous Materials: Materials Genomics and Machine Learning
Jablonka, K. M., Ongari, D., Moosavi, S. M., & Smit, B. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00004 · Cited by 599
Yao, N., Chen, X., Fu, Z.-H., & Zhang, Q. (2022) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00904 · Cited by 562
Machine-learned potentials for next-generation matter simulations
Friederich, P., Häse, F., Proppe, J., & Aspuru-Guzik, A. (2021) · Nature Materials · doi:10.1038/s41563-020-0777-6 · Cited by 560
Physics-Inspired Structural Representations for Molecules and Materials
Musil, F., Grisafi, A., Bartók, A. P., Ortner, C., Csányi, G., & Ceriotti, M. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.1c00021 · Cited by 523
Machine Learning a General-Purpose Interatomic Potential for Silicon
Bartók, A. P., Kermode, J., Bernstein, N., & Csányi, G. (2018) · Physical Review X · doi:10.1103/physrevx.8.041048 · Cited by 470
A Randomized Algorithm for Principal Component Analysis
Rokhlin, V., Szlam, A., & Tygert, M. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/080736417 · Cited by 422
Randomized Algorithms for Matrices and Data
MAHONEY, M. (2012) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/b11822-37 · Cited by 409
Self-citationThomas, S., Kuska, M. T., Bohnenkamp, D., Brugger, A., Alisaac, E., Wahabzada, M., Behmann, J., & Mahlein, A.-K. (2018) · Journal of Plant Diseases and Protection · doi:10.1007/s41348-017-0124-6 · Cited by 356
Imbalzano, G., Anelli, A., Giofré, D., Klees, S., Behler, J., & Ceriotti, M. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5024611 · Cited by 330
Neural Network Potentials: A Concise Overview of Methods
Kocer, E., Ko, T. W., & Behler, J. (2022) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-082720-034254 · Cited by 306
Randomized numerical linear algebra: Foundations and algorithms
Martinsson, P.-G., & Tropp, J. A. (2020) · Acta Numerica · doi:10.1017/s0962492920000021 · Cited by 300
Dragoni, D., Daff, T. D., Csányi, G., & Marzari, N. (2018) · Physical Review Materials · doi:10.1103/physrevmaterials.2.013808 · Cited by 284
Unsupervised machine learning for exploratory data analysis in imaging mass spectrometry
Verbeeck, N., Caprioli, R. M., & Van de Plas, R. (2020) · Mass Spectrometry Reviews · doi:10.1002/mas.21602 · Cited by 281
Optimal Subsampling for Large Sample Logistic Regression
Wang, H., Zhu, R., & Ma, P. (2018) · Journal of the American Statistical Association · doi:10.1080/01621459.2017.1292914 · Cited by 272
Data-Driven Aerospace Engineering: Reframing the Industry with Machine Learning
Brunton, S. L., Nathan Kutz, J., Manohar, K., Aravkin, A. Y., Morgansen, K., Klemisch, J., Goebel, N., Buttrick, J., Poskin, J., Blom-Schieber, A. W., et al. (2021) · AIAA Journal · doi:10.2514/1.j060131 · Cited by 270
Fast approximation of matrix coherence and statistical leverage
Petros Drineas, B., Magdon‐Ismail, M., Mahoney, M. W., & Woodruff, D. P. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.3843 · Cited by 164
Self-citationJinnouchi, R., Karsai, F., Verdi, C., Asahi, R., & Kresse, G. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0009491 · Cited by 256
Atom-density representations for machine learning
Willatt, M. J., Musil, F., & Ceriotti, M. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5090481 · Cited by 179
Nguyen, T. T., Székely, E., Imbalzano, G., Behler, J., Csányi, G., Ceriotti, M., Götz, A. W., & Paesani, F. (2018) · The Journal of Chemical Physics · doi:10.1063/1.5024577 · Cited by 171
A Berkeley View of Systems Challenges for AI
Stoica, I., Song, D., Popa, R. A., Patterson, D., Mahoney, M. W., Katz, R., Joseph, A. D., Jordan, M., Hellerstein, J. M., Gonzalez, J. E., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.05855 · Cited by 171
“…that the output of the AI algorithm is understandable to a subject matter expert in terms of concepts from the domain from which the data are drawn [69], while the former means that one can identify the properties of the input to the AI algorithm that are responsible for the particular output, and…”
BackgroundSelf-citationAnderson, A., Douglas, P. K., Kerr, W. T., Haynes, V. S., Yuille, A. L., Xie, J., Wu, Y. N., Brown, J. A., & Cohen, M. S. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2013.12.015 · Cited by 136
Automated diagnoses of attention deficit hyperactive disorder using magnetic resonance imaging
Eloyan, A., Muschelli, J., Nebel, M. B., Liu, H., Han, F., Zhao, T., Barber, A. D., Joel, S., Pekar, J. J., Mostofsky, S. H., et al. (2012) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2012.00061 · Cited by 126
Plant Phenotyping using Probabilistic Topic Models: Uncovering the Hyperspectral Language of Plants
Wahabzada, M., Mahlein, A.-K., Bauckhage, C., Steiner, U., Oerke, E.-C., & Kersting, K. (2016) · Scientific Reports · doi:10.1038/srep22482 · Cited by 118
Exploration, Sampling, And Reconstruction of Free Energy Surfaces with Gaussian Process Regression
Mones, L., Bernstein, N., & Csányi, G. (2016) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6b00553 · Cited by 91
Cross-Attention-Based Saliency Inference for Predicting Cancer Metastasis on Whole Slide Images
Su, Z., Rezapour, M., Sajjad, U., Niu, S., Gurcan, M. N., & Niazi, M. K. K. (2024) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2024.3439499 · Cited by 10
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.