Just relax: convex programming methods for identifying sparse signals in noise
The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Abstract
This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination that has been contaminated with additive noise, the goal is to identify which elementary signals participated and to approximate their coefficients. Although many algorithms have been proposed, there is little theory which guarantees that these algorithms can accurately and efficiently solve the problem. This paper studies a method called convex relaxation, which attempts to recover the ideal sparse signal by solving a convex program. This approach is powerful because the optimization can be completed in polynomial time with standard scientific software. The paper provides general conditions which ensure that convex relaxation succeeds. As evidence of the broad impact of these results, the paper describes how convex relaxation can be used for several concrete signal recovery problems. It also describes applications to channel coding, linear regression, and numerical 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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
A Wavelet Tour of Signal Processing
(1999) · Elsevier eBooks · doi:10.1016/b978-0-12-466606-1.x5000-4 · Cited by 16,227
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Cited by
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Nearly unbiased variable selection under minimax concave penalty
Zhang, C.-H. (2010) · The Annals of Statistics · doi:10.1214/09-aos729 · Cited by 3,835
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
Donoho, D. L., Tsaig, Y., Drori, I., & Starck, J.-L. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173241 · Cited by 1,509
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit
Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.030 · Cited by 1,347
Self-citationSensor Selection via Convex Optimization
Joshi, S., & Boyd, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007095 · Cited by 1,311
Gradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
Cai, T. T., & Wang, L. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146090 · Cited by 1,265
Iterative Thresholding for Sparse Approximations
Blumensath, T., & Davies, M. E. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9035-z · Cited by 1,248
Discriminative K-SVD for dictionary learning in face recognition
Zhang, Q., & Li, B. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539989 · Cited by 1,237
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
Towards a Mathematical Theory of Super‐resolution
Candès, E. J., & Fernandez‐Granda, C. (2014) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21455 · Cited by 1,169
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Self-citationImaging via Compressive Sampling
Romberg, J. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914729 · Cited by 1,014
Confidence Intervals for Low Dimensional Parameters in High Dimensional Linear Models
Zhang, C.-H., & Zhang, S. S. (2014) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12026 · Cited by 993
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
High-dimensional Ising model selection using ℓ1-regularized logistic regression
Ravikumar, P., Wainwright, M. J., & Lafferty, J. D. (2010) · The Annals of Statistics · doi:10.1214/09-aos691 · Cited by 892
High-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Needell, D., & Vershynin, R. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042412 · Cited by 850
On sparse reconstruction from Fourier and Gaussian measurements
Rudelson, M., & Vershynin, R. (2008) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20227 · Cited by 847
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
Donoho, D. L., & Tsaig, Y. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929958 · Cited by 829
Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
Chen, J., & Huo, X. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881263 · Cited by 810
Comparing Measures of Sparsity
Hurley, N., & Rickard, S. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2027527 · Cited by 757
High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence
Ravikumar, P., Wainwright, M. J., Raskutti, G., & Yu, B. (2011) · Electronic Journal of Statistics · doi:10.1214/11-ejs631 · Cited by 744
Compressed Sensing for Real-Time Energy-Efficient ECG Compression on Wireless Body Sensor Nodes
Mamaghanian, H., Khaled, N., Atienza, D., & Vandergheynst, P. (2011) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2011.2156795 · Cited by 701
Yardibi, T., Li, J., Stoica, P., Xue, M., & Baggeroer, A. B. (2010) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2010.5417172 · Cited by 699
Algorithms for simultaneous sparse approximation. Part II: Convex relaxation
Tropp, J. A. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.031 · Cited by 691
Self-citationBest subset selection via a modern optimization lens
Bertsimas, D., King, A., & Mazumder, R. (2016) · The Annals of Statistics · doi:10.1214/15-aos1388 · Cited by 655
Strong Rules for Discarding Predictors in Lasso-Type Problems
Tibshirani, R., Bien, J., Friedman, J., Hastie, T., Simon, N., Taylor, J., & Tibshirani, R. J. (2012) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.01004.x · Cited by 653
Kim, S.-J., Koh, K., Boyd, S., & Gorinevsky, D. (2009) · SIAM Review · doi:10.1137/070690274 · Cited by 615
(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
Vaswani, N., & Lu, W. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2051150 · Cited by 517
Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
Liu, Z., & Vandenberghe, L. (2010) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090755436 · Cited by 490
Lasso-type recovery of sparse representations for high-dimensional data
Meinshausen, N., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos582 · Cited by 489
Sparse identification of nonlinear dynamics for model predictive control in the low-data limit
Kaiser, E., Kutz, J. N., & Brunton, S. L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2018.0335 · Cited by 462
Learning Multiscale Sparse Representations for Image and Video Restoration
Mairal, J., Sapiro, G., & Elad, M. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070697653 · Cited by 460
L1-L2 Optimization in Signal and Image Processing
Zibulevsky, M., & Elad, M. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936023 · Cited by 426
Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032816 · Cited by 420
Spatiotemporal Reflectance Fusion via Sparse Representation
Huang, B., & Song, H. (2012) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2186638 · Cited by 418
Hyperspectral Image Denoising via Sparse Representation and Low-Rank Constraint
Zhao, Y.-Q., & Yang, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2321557 · Cited by 392
High-dimensional variable selection
Wasserman, L., & Roeder, K. (2009) · The Annals of Statistics · doi:10.1214/08-aos646 · Cited by 373
The cosparse analysis model and algorithms
Nam, S., Davies, M. E., Elad, M., & Gribonval, R. (2013) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2012.03.006 · Cited by 353
A unified Bayesian framework for MEG/EEG source imaging
Wipf, D., & Nagarajan, S. (2009) · NeuroImage · doi:10.1016/j.neuroimage.2008.02.059 · Cited by 350
Support union recovery in high-dimensional multivariate regression
Obozinski, G., Wainwright, M. J., & Jordan, M. I. (2011) · The Annals of Statistics · doi:10.1214/09-aos776 · Cited by 350
Handbook of Mathematical Methods in Imaging
(2011) · Springer eBooks · doi:10.1007/978-0-387-92920-0 · Cited by 334
Das, A., & Kempe, D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1102.3975 · Cited by 330
Xenaki, A., Gerstoft, P., & Mosegaard, K. (2014) · The Journal of the Acoustical Society of America · doi:10.1121/1.4883360 · Cited by 326
Learning generative models for protein fold families
Balakrishnan, S., Kamisetty, H., Carbonell, J. G., Lee, S., & Langmead, C. J. (2011) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22934 · Cited by 316
“See [21] for a recent review of L 1 -regularization.”
BackgroundCompressed Sensing With Quantized Measurements
Zymnis, A., Boyd, S., & Candes, E. (2010) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2035667 · Cited by 316
Structured Sparsity through Convex Optimization
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012) · Statistical Science · doi:10.1214/12-sts394 · Cited by 315
Morphological Component Analysis: An Adaptive Thresholding Strategy
Bobin, J., Starck, J.-L., Fadili, J. M., Moudden, Y., & Donoho, D. L. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.907073 · Cited by 314
Recovery of Exact Sparse Representations in the Presence of Bounded Noise
Fuchs, J. J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855614 · Cited by 314
Compression of facial images using the K-SVD algorithm
Bryt, O., & Elad, M. (2008) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2008.03.001 · Cited by 311
Latent Variable Bayesian Models for Promoting Sparsity
Wipf, D. P., Rao, B. D., & Nagarajan, S. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2162174 · Cited by 305
A Nonparametric Approach to Modeling Choice with Limited Data
Farias, V. F., Jagabathula, S., & Shah, D. (2013) · Management Science · doi:10.1287/mnsc.1120.1610 · Cited by 304
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Gasso, G., Rakotomamonjy, A., & Canu, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2026004 · Cited by 304
Direction of Arrival Estimation Using Co-Prime Arrays: A Super Resolution Viewpoint
Tan, Z., Eldar, Y. C., & Nehorai, A. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2354316 · Cited by 302
Real-Time Convex Optimization in Signal Processing
Mattingley, J., & Boyd, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936020 · Cited by 300
A General Theory of Concave Regularization for High-Dimensional Sparse Estimation Problems
Zhang, C.-H., & Zhang, T. (2012) · Statistical Science · doi:10.1214/12-sts399 · Cited by 296
Super-Resolution With Sparse Mixing Estimators
Mallat, S., & Yu, G. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2049927 · Cited by 296
Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing
Maleki, A., & Donoho, D. L. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2039176 · Cited by 289
In Vivo Quantitative Susceptibility Mapping (QSM) in Alzheimer's Disease
Acosta-Cabronero, J., Williams, G. B., Cardenas-Blanco, A., Arnold, R. J., Lupson, V., & Nestor, P. J. (2013) · PLoS ONE · doi:10.1371/journal.pone.0081093 · Cited by 287
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers
Negahban, S. N., Ravikumar, P., Wainwright, M. J., & Yu, B. (2012) · Statistical Science · doi:10.1214/12-sts400 · Cited by 287
On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
Bruckstein, A. M., Elad, M., & Zibulevsky, M. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929920 · Cited by 285
Kang, H., Zhang, A., Cai, T. T., & Small, D. S. (2016) · Journal of the American Statistical Association · doi:10.1080/01621459.2014.994705 · Cited by 265
“Instead, a computationally tractable version of estimation strategies like (8) has been proposed in the literature using a convex surrogate of the l0 norm (Candes and Tao 2005; Tropp 2006; Donoho 2006).”
MethodWen, Z., Yin, W., Goldfarb, D., & Zhang, Y. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090747695 · Cited by 280
Proximal Methods for Hierarchical Sparse Coding
Jenatton, R., Mairal, J., Obozinski, G., & Bach, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.2139 · Cited by 272
Compressed Sensing in Astronomy
Bobin, J., Starck, J.-L., & Ottensamer, R. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2008.2005337 · Cited by 268
A unified approach to model selection and sparse recovery using regularized least squares
Lv, J., & Fan, Y. (2009) · The Annals of Statistics · doi:10.1214/09-aos683 · Cited by 252
A variational formulation for frame-based inverse problems
Chaux, C., Combettes, P. L., Pesquet, J.-C., & Wajs, V. R. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/4/008 · Cited by 249
“φk = ωk| � | with ωk > 0 in Problem 3.1, one aims at setting to zero the kth coefficient if it falls into the interval [−ωk, ωk], hence promoting sparsity (see [17, 22, 34 ] for special cases).”
BackgroundInfluentialData-driven science and engineering : machine learning, dynamical systems, and control
Brunton, S. L., & Kutz, J. N. (2019) · doi:10.1017/978-1-009-08951-7 · Cited by 242
Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
Ben-Haim, Z., Eldar, Y. C., & Elad, M. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2052460 · Cited by 241
“In the case of sparse estimation under Gaussian noise, it has recently been shown that the unbiased CRB is identical (for almost all values of x 0 ) to the MSE of the “oracle” estimator, which knows the locations of the nonzero elements of x 0 [10].”
MethodJoint learning and dictionary construction for pattern recognition
Pham, D.-S., & Venkatesh, S. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587408 · Cited by 232
“The results show that the proposed method is competitive against other recently proposed sparse overcomplete counterparts and considerably outperforms many recently proposed face recognition techniques when the number training samples is small.”
BackgroundResultXu, H., Caramanis, C., & Mannor, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048503 · Cited by 230
“, [21], and are used as standard tools in investigating sparsity of Lasso from the statistical perspective.”
MethodKressler, B., de Rochefort, L., Liu, T., Spincemaille, P., Jiang, Q., & Wang, Y. (2010) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2009.2023787 · Cited by 220
“imation of signals (often referred to as basis pursuit) [26].”
Compressed sensing for practical optical imaging systems: a tutorial
Marcia, R. F. (2011) · Optical Engineering · doi:10.1117/1.3596602 · Cited by 201
Sparse nonnegative matrix factorization with ℓ0-constraints
Peharz, R., & Pernkopf, F. (2012) · Neurocomputing · doi:10.1016/j.neucom.2011.09.024 · Cited by 163
“Similar as for matching pursuit, there exist theoretical optimality guarantees and error bounds for BP [36,15].”
BackgroundMethodCompressed Sensing Performance Bounds Under Poisson Noise
Raginsky, M., Willett, R. M., Harmany, Z. T., & Marcia, R. F. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2049997 · Cited by 161
“…imaging systems impose hard constraints on the nature of the measurements that can be collected, such as non-negativity, which are not considered in much of the existing compressed sensing literature (recent papers of Dai and Milenkovic [15] and of Khajehnejad et al. [16] are notable exceptions).”
BackgroundMethodInfluential
Metadata
- Authors
- Tropp, J. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-03
- Volume
- 52
- Issue
- 3
- Pages
- 1030-1051
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2147656689
- Cited by
- 1,407
- References
- 58
- FWCI
- 84.53
- Type
- journal article
- Language
- en
- Open access
- closed
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.