ArticleProceedings of the National Academy of Sciences of the United States of America2009
CUR matrix decompositions for improved data analysis.
Article in Proceedings of the National Academy of Sciences of the United States of America, 2009. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 52 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
52 citing papers in PubMed.
- Reducing acquisition time and radiation damage: data-driven subsampling for spectro-microscopy.Journal of synchrotron radiation · 2026Article
- Data-Driven Pressure Sensor Subset Selection for Long-Distance Water Transfer Pipelines: Q-DEIM Benchmarking with Spatial-Diversity Refinement.Sensors (Basel, Switzerland) · 2026Article
- Contrastive Dimension Reduction: A Systematic Review.Wiley interdisciplinary reviews. Computational statistics · 2026Article
- Multimodal graph fusion with statistically guided parsimonious descriptor selection for molecular property prediction.Journal of cheminformatics · 2026Article
- Subspace Method of Moments forSIAM journal on imaging sciences · 2026Article
- Comparing subset selection methods in multi-lead electrocardiogram data.Network modeling and analysis in health informatics and bioinformatics · 2026Article
- Multi-phase dataset for bulk Ti and the Ti-6Al-4V alloy.Scientific data · 2025Article
- Article
- Optimal Surrogate-Assisted Sampling for Cost-Efficient Validation of Electronic Health Record Outcomes.Statistics in medicine · 2025Article
- Cross-Attention-Based Saliency Inference for Predicting Cancer Metastasis on Whole Slide Images.IEEE journal of biomedical and health informatics · 2024Article
- Development of message passing-based graph convolutional networks for classifying cancer pathology reports.BMC medical informatics and decision making · 2024Article
- Cryo-EM Heterogeneity Analysis using Regularized Covariance Estimation and Kernel Regression.bioRxiv : the preprint server for biology · 2024Article
- Hybrid Twins Modeling of a High-Level Radioactive Waste Cell Demonstrator for Long-Term Temperature Monitoring and Forecasting.Sensors (Basel, Switzerland) · 2024Article
- Lossless and Near-Lossless Compression Algorithms for Remotely Sensed Hyperspectral Images.Entropy (Basel, Switzerland) · 2024Article
- Interpretable Performance Models for Energetic Materials using Parsimonious Neural Networks.The journal of physical chemistry. A · 2024Article
- MarkerMap: nonlinear marker selection for single-cell studies.NPJ systems biology and applications · 2024Article
- Mode Coresets for Efficient, Interpretable Tensor Decompositions: An Application to Feature Selection in fMRI Analysis.IEEE access : practical innovations, open solutions · 2024Article
- Attention2Minority: A salient instance inference-based multiple instance learning for classifying small lesions in whole slide images.Computers in biology and medicine · 2023Article
- Unravelling the Impact of Metal Dopants and Oxygen Vacancies on Syngas Conversion over Oxides: A Machine Learning-Accelerated Study of CO Activation on Cr-Doped ZnO Surfaces.ACS catalysis · 2023Article
- Neural network potentials for accelerated metadynamics of oxygen reduction kinetics at Au-water interfaces.Chemical science · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
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.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.