The DOI matches its Crossref record; 107 of the 107 references it cites were found in a registry or an index.
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
Open accessAbstract
Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets. This paper presents a modular framework for constructing randomized algorithms that compute partial matrix decompositions. These methods use random sampling to identify a subspace that captures most of the action of a matrix. The input matrix is then compressed—either explicitly or implicitly—to this subspace, and the reduced matrix is manipulated deterministically to obtain the desired low-rank factorization. In many cases, this approach beats its classical competitors in terms of accuracy, robustness, and/or speed. These claims are supported by extensive numerical experiments and a detailed error analysis. The specific benefits of randomized techniques depend on the computational environment. Consider the model problem of finding the k dominant components of the singular value decomposition of an $m \times n$ matrix. (i) For a dense input matrix, randomized algorithms require $\bigO(mn \log(k))$ floating-point operations (flops) in contrast to $ \bigO(mnk)$ for classical algorithms. (ii) For a sparse input matrix, the flop count matches classical Krylov subspace methods, but the randomized approach is more robust and can easily be reorganized to exploit multiprocessor architectures. (iii) For a matrix that is too large to fit in fast memory, the randomized techniques require only a constant number of passes over the data, as opposed to $\bigO(k)$ passes for classical algorithms. In fact, it is sometimes possible to perform matrix approximation with a single pass over the data.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Metropolis, N., & Ulam, S. (1949) · Journal of the American Statistical Association · doi:10.1080/01621459.1949.10483310 · Cited by 6,474
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276876 · Cited by 4,188
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
The FERET evaluation methodology for face-recognition algorithms
Phillips, P. J., Moon, H., Rizvi, S. A., & Rauss, P. J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.879790 · Cited by 3,692
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Aspects of Multivariate Statistical Theory
Gleser, L. J. (1984) · Technometrics · doi:10.1080/00401706.1984.10487948 · Cited by 3,277
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
Bhatia, R. (1996) · Cited by 2,847
Universal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
Random Features for Large-Scale Kernel Machines
Rahimi, A., & Recht, B. (2007) · Cited by 2,783
(2008) · Choice Reviews Online · doi:10.5860/choice.45-5628 · Cited by 2,725
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B., & Lindenstrauss, J. (1984) · Contemporary Mathematics · doi:10.1090/conm/026/737400 · Cited by 2,523
The FERET database and evaluation procedure for face-recognition algorithms
Phillips, P. J., Wechsler, H., Huang, J., & Rauss, P. J. (1998) · Image and Vision Computing · doi:10.1016/s0262-8856(97)00070-x · Cited by 2,431
Low-dimensional procedure for the characterization of human faces
Sirovich, L., & Kirby, M. (1987) · Journal of the Optical Society of America A · doi:10.1364/josaa.4.000519 · Cited by 2,311
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
The Power of Convex Relaxation: Near-Optimal Matrix Completion
Candes, E. J., & Tao, T. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2044061 · Cited by 2,060
The Concentration of Measure Phenomenon
Ledoux, M. (2005) · Mathematical Surveys and Monographs · doi:10.1090/surv/089 · Cited by 1,700
Coifman, R. R., Lafon, S., Lee, A. B., Maggioni, M., Nadler, B., Warner, F., & Zucker, S. W. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0500334102 · Cited by 1,675
Data Streams: Algorithms and Applications
Muthukrishnan, S. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019604 · Cited by 1,433
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Achlioptas, D. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00025-4 · Cited by 1,392
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Exact matrix completion via convex optimization
Candès, E., & Recht, B. (2012) · Communications of the ACM · doi:10.1145/2184319.2184343 · Cited by 996
A Randomized Kaczmarz Algorithm with Exponential Convergence
Strohmer, T., & Vershynin, R. (2009) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9030-4 · Cited by 903
A new version of the Fast Multipole Method for the Laplace equation in three dimensions
Greengard, L., & Rokhlin, V. (1997) · Acta Numerica · doi:10.1017/s0962492900002725 · Cited by 879
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
The space complexity of approximating the frequency moments
Alon, N., Matias, Y., & Szegedy, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237823 · Cited by 822
On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning
Petros Drineas, B., & Mahoney, M. W. (2005) · doi:10.5555/1046920.1194916 · Cited by 795
EM Algorithms for PCA and SPCA
Roweis, S. T. (1997) · Cited by 780
CUR matrix decompositions for improved data analysis
Mahoney, M. W., & Drineas, P. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0803205106 · Cited by 773
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Gu, M., & Eisenstat, S. C. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917055 · Cited by 677
Improved Approximation Algorithms for Large Matrices via Random Projections
Sarlos, T. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.37 · Cited by 646
SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
MIRSKY, L. (1960) · The Quarterly Journal of Mathematics · doi:10.1093/qmath/11.1.50 · Cited by 611
On lipschitz embedding of finite metric spaces in Hilbert space
Bourgain, J. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02776078 · Cited by 560
Randomized algorithms for the low-rank approximation of matrices
Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0709640104 · Cited by 559
Self-citationLatent Semantic Indexing: A Probabilistic Analysis
Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1711 · Cited by 556
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442696 · Cited by 552
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
Candes, E. J., & Romberg, J. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0162-x · Cited by 504
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
Clustering Large Graphs via the Singular Value Decomposition
Petros Drineas, B., FRIEZE, A. M., Kannan, R., Vempala, S., & Vinay, V. (2004) · Machine Learning · doi:10.1023/b:mach.0000033113.59016.96 · Cited by 487
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442684 · Cited by 487
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
Local Operator Theory, Random Matrices and Banach Spaces
(2001) · Handbook of the Geometry of Banach Spaces · doi:10.1016/s1874-5849(01)80010-3 · Cited by 432
Data compression and harmonic analysis
Donoho, D. L., Vetterli, M., DeVore, R. A., & Daubechies, I. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720544 · Cited by 432
Faster least squares approximation
Petros Drineas, B., Mahoney, M. W., Muthukrishnan, S., & Sarlós, T. (2010) · Numerische Mathematik · doi:10.1007/s00211-010-0331-6 · Cited by 429
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
On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
Stewart, G. W. (1977) · SIAM Review · doi:10.1137/1019104 · Cited by 416
Construction and Arithmetics of H -Matrices
Grasedyck, L., & Hackbusch, W. (2003) · Computing · doi:10.1007/s00607-003-0019-1 · Cited by 402
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Ailon, N., & Chazelle, B. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132597 · Cited by 379
Random Vectors in the Isotropic Position
Rudelson, M. (1999) · Journal of Functional Analysis · doi:10.1006/jfan.1998.3384 · Cited by 371
A randomized algorithm for the decomposition of matrices
Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.003 · Cited by 352
Self-citationTwo algorithms for nearest-neighbor search in high dimensions
Kleinberg, J. M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258653 · Cited by 348
Numerics of Gram-Schmidt orthogonalization
Björck, Å. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90493-6 · Cited by 320
Guest Editors Introduction to the top 10 algorithms
Dongarra, J., & Sullivan, F. (2000) · Computing in Science & Engineering · doi:10.1109/mcise.2000.814652 · Cited by 320
Drineas, P., Kannan, R., & Mahoney, M. W. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539704442702 · Cited by 310
On the Compression of Low Rank Matrices
Cheng, H., Gimbutas, Z., Martinsson, P. G., & Rokhlin, V. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030602678 · Cited by 301
Self-citationNumerical linear algebra in the streaming model
Clarkson, K. L., & Woodruff, D. P. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536445 · Cited by 301
Fast computation of low-rank matrix approximations
Achlioptas, D., & Mcsherry, F. (2007) · Journal of the ACM · doi:10.1145/1219092.1219097 · Cited by 292
An improved approximation algorithm for the column subset selection problem
Boutsidis, C., Mahoney, M. W., & Petros Drineas, B. (2009) · doi:10.5555/1496770.1496875 · Cited by 286
A fast randomized algorithm for the approximation of matrices
Woolfe, F., Liberty, E., Rokhlin, V., & Tygert, M. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.12.002 · Cited by 280
A Randomized Algorithm for the Approximation of Matrices
Martinsson, P.-G., Rockhlin, V., & Tygert, M. (2006) · doi:10.21236/ada458932 · Cited by 268
Self-citationOn Talagrand's deviation inequalities for product measures
Ledoux, M. (1997) · ESAIM: Probability and Statistics · doi:10.1051/ps:1997103 · Cited by 255
Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
Kuczyński, J., & Woźniakowski, H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613066 · Cited by 251
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2006) · 2006 40th Annual Conference on Information Sciences and Systems · doi:10.1109/ciss.2006.286463 · Cited by 248
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
Kushilevitz, E., Ostrovsky, R., & Rabani, Y. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798347177 · Cited by 245
On the conditioning of random subdictionaries
Tropp, J. A. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.09.001 · Cited by 212
Self-citationTracking join and self-join sizes in limited storage
Alon, N., Gibbons, P. B., Matias, Y., & Szegedy, M. (1999) · doi:10.1145/303976.303978 · Cited by 211
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
Ailon, N., & Liberty, E. (2009) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9110-x · Cited by 194
Random Sampling in Cut, Flow, and Network Design Problems
Karger, D. R. (1999) · Mathematics of Operations Research · doi:10.1287/moor.24.2.383 · Cited by 189
Adaptive Sampling and Fast Low-Rank Matrix Approximation
Deshpande, A., & Vempala, S. (2006) · Lecture Notes in Computer Science · doi:10.1007/11830924_28 · Cited by 186
A fast randomized algorithm for overdetermined linear least-squares regression
Rokhlin, V., & Tygert, M. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0804869105 · Cited by 183
Efficient Volume Sampling for Row/Column Subset Selection
Deshpande, A., & Rademacher, L. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.38 · Cited by 181
Demmel, J., Dumitriu, I., & Holtz, O. (2007) · Numerische Mathematik · doi:10.1007/s00211-007-0114-x · Cited by 169
Beichl, I., & Sullivan, F. (2000) · Computing in Science & Engineering · doi:10.1109/5992.814660 · Cited by 163
On the existence and computation of rank-revealing LU factorizations
Pan, C.-T. (2000) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(00)00120-8 · Cited by 156
Efficient agnostic learning of neural networks with bounded fan-in
Lee, W. S., Bartlett, P. L., & Williamson, R. C. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.556601 · Cited by 150
Demmel, J. W., Dumitriu, I., & Holtz, O. (2007) · Cited by 143
Unsupervised feature selection for principal components analysis
Boutsidis, C., Mahoney, M. W., & Petros Drineas, B. (2008) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1401890.1401903 · Cited by 132
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Sun, J., Xie, Y., Zhang, H., & Faloutsos, C. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.33 · Cited by 121
Sampling Algorithms and Coresets for $\ell_p$ Regression
Dasgupta, A., Petros Drineas, B., Harb, B., Kumar, R., & Mahoney, M. W. (2009) · SIAM Journal on Computing · doi:10.1137/070696507 · Cited by 112
Regularization on Graphs with Function-adapted Diffusion Processes
Szlam, A. D., Maggioni, M., & Coifman, R. R. (2008) · doi:10.5555/1390681.1442788 · Cited by 109
Estimating Extremal Eigenvalues and Condition Numbers of Matrices
Dixon, J. D. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720053 · Cited by 106
A Fast Random Sampling Algorithm for Sparsifying Matrices
Arora, S., Hazan, E., & Kale, S. (2006) · Lecture notes in computer science · doi:10.1007/11830924_26 · Cited by 84
Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
Jogdeo, K., & Samuels, S. M. (1968) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177698243 · Cited by 83
The decompositional approach to matrix computation
Stewart, G. W. (2000) · Computing in Science & Engineering · doi:10.1109/5992.814658 · Cited by 81
Spaces with Large Distance to ℓ n ∞ and Random Matrices
Szarek, S. J. (1990) · American Journal of Mathematics · doi:10.2307/2374731 · Cited by 73
Asymptotic distribution of the errors in scalar and vector quantizers
Lee, D. H., & Neuhoff, D. L. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.485715 · Cited by 58
Less is More: Sparse Graph Mining with Compact Matrix Decomposition
Sun, J., Xie, Y., Zhang, H., & Faloutsos, C. (2007) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.102 · Cited by 57
Dense Fast Random Projections and Lean Walsh Transforms
Liberty, E., Ailon, N., & Singer, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85363-3_40 · Cited by 42
A Randomized Approximate Nearest Neighbors Algorithm
Jones, P. W., Osipov, A., & Rokhlin, V. (2010) · doi:10.21236/ada555156 · Cited by 39
Low-dimensional embedding of fMRI datasets
Shen, X., & Meyer, F. G. (2008) · NeuroImage · doi:10.1016/j.neuroimage.2008.02.051 · Cited by 28
Subsampling Algorithms for Semidefinite ProgrammingPreprint
d’Aspremont, A. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0803.1990 · Cited by 19
Accelerated dense random projections
Zucker, S. W., & Liberty, E. (2009) · Cited by 18
On sparse representations of linear operators and the approximation of matrix products
Belabbas, M.-A., & Wolfe, P. J. (2008) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2008.4558532 · Cited by 17
Cited by
On hyperparameter optimization of machine learning algorithms: Theory and practice
Yang, L., & Shami, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.07.061 · Cited by 3,232
Machine Learning for Fluid Mechanics
Brunton, S. L., Noack, B. R., & Koumoutsakos, P. (2020) · Annual Review of Fluid Mechanics · doi:10.1146/annurev-fluid-010719-060214 · Cited by 3,063
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Single-Cell Map of Diverse Immune Phenotypes in the Breast Tumor Microenvironment
Azizi, E., Carr, A. J., Plitas, G., Cornish, A. E., Konopacki, C., Prabhakaran, S., Nainys, J., Wu, K., Kiseliovas, V., Setty, M., et al. (2018) · Cell · doi:10.1016/j.cell.2018.05.060 · Cited by 1,976
Modal Analysis of Fluid Flows: An Overview
Taira, K., Brunton, S. L., Dawson, S. T. M., Rowley, C. W., Colonius, T., McKeon, B. J., Schmidt, O. T., Gordeyev, S., Theofilis, V., & Ukeiley, L. S. (2017) · AIAA Journal · doi:10.2514/1.j056060 · Cited by 1,894
Metadata
- Authors
- Halko, N., Martinsson, P. G., & Tropp, J. A.
- Venue
- SIAM Review
- Published
- 2011-01
- Volume
- 53
- Issue
- 2
- Pages
- 217-288
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2117756735
- Cited by
- 4,002
- References
- 107
- FWCI
- 128.87
- Type
- journal article
- Language
- en
- Open access
- green
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.