The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Kernel Matching Pursuit
Open accessOverview
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 2×
“KMP in its basic form is also very similar to boosting algorithms [4, 6], in which the chosen class of weak-learners would be the set of kernels centered on the training points.”
BackgroundMethodAdvances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Orthogonal least squares learning algorithm for radial basis function networks
Chen, S., Cowan, C. F. N., & Grant, P. M. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80341 · Cited by 3,362
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Neural Networks: Tricks of the Trade: Second Edition
(2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8 · Cited by 2,116
Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning
Айзерман, М. А. (1964) · Automation and Remote Control · Cited by 1,485
Comparing support vector machines with Gaussian kernels to radial basis function classifiers
Scholkopf, B., Sung, K.-K., Burges, C. J. C., Girosi, F., Niyogi, P., Poggio, T., & Vapnik, V. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650102 · Cited by 1,400
LeCun, Y., Bottou, L., Orr, G., & Müller, K. (1998) · neural information processing systems · Cited by 1,333
Large margin classification using the perceptron algorithm
Freund, Y., & Schapire, R. E. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279985 · Cited by 1,071
Inference for the Generalization Error
Nadeau, C., & Bengio, Y. (2003) · Machine Learning · doi:10.1023/a:1024068626366 · Cited by 1,026
Self-citationLeCun, Y., Bottou, L., Orr, G. B., & Müller, K. R. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49430-8_2 · Cited by 919
Tipping, M. E. (1999) · Cited by 912
Boosting Algorithms as Gradient Descent
Mason, L., Baxter, J., Bartlett, P. L., & Frean, M. R. (1999) · Cited by 767
Boosting the margin: A new explanation for the effectiveness of voting methods
Schapire, R. E., Freund, Y., Barlett, P., & Lee, W. S. (1997) · Cited by 711
Sparse Greedy Matrix Approximation for Machine Learning
Smola, A. J., & Schökopf, B. (2000) · doi:10.5555/645529.657980 · Cited by 574
Structural risk minimization over data-dependent hierarchies
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705570 · Cited by 527
Inference for the Generalization ErrorPreprint
Bengio, Y., & Nadeau, C. (1999) · RePEc: Research Papers in Economics · Cited by 485
Self-citationChen, S., & Donoho, D. L. (1994) · Cited by 467
Adaptive time-frequency decompositions
Mallat, S. G. (1994) · Optical Engineering · doi:10.1117/12.173207 · Cited by 358
Sparse Greedy Gaussian Process Regression
Smola, A. J., & Bartlett, P. L. (2000) · Cited by 316
Sample compression, learnability, and the Vapnik-Chervonenkis dimension
Floyd, S., & Warmuth, M. (1995) · Machine Learning · doi:10.1007/bf00993593 · Cited by 256
Relating Data Compression and Learnability
Littlestone, N., & Warmuth, M. K. (2003) · Cited by 208
Structural Modelling with Sparse Kernels
Gunn, S. R., & Kandola, J. S. (2002) · Machine Learning · doi:10.1023/a:1013903804720 · Cited by 101
A Sparse Representation for Function Approximation
Poggio, T., & Girosi, F. (1998) · Neural Computation · doi:10.1162/089976698300017250 · Cited by 81
Semiparametric Support Vector and Linear Programming Machines
Smola, A. J., Frieß, T.-T., & Schölkopf, B. (1998) · Cited by 80
Density estimation using support vector machines
Vovk, V., & Vapnik, V. N. (1997) · Cited by 36
Singer, Y. (1999) · Cited by 11
(1996)
(1998)
Cited by
The Kernel Recursive Least-Squares Algorithm
Engel, Y., Mannor, S., & Meir, R. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830985 · Cited by 1,104
Single-Image Super-Resolution Using Sparse Regression and Natural Image Prior
Kim, K. I., & Kwon, Y. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.25 · Cited by 956
Hyperspectral Image Classification via Kernel Sparse Representation
Chen, Y., Nasrabadi, N. M., & Tran, T. D. (2013) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2201730 · Cited by 514
Building Support Vector Machines with Reduced Classifier Complexity
Keerthi, S. S., Chapelle, O., & DeCoste, D. (2006) · MPG.PuRe (Max Planck Society) · doi:10.5555/1248547.1248602 · Cited by 263
Machine Learning Methods for Predicting Failures in Hard Drives: A Multiple-Instance Application
Murray, J. F., Hughes, G. F., & Kreutz-Delgado, K. (2005) · doi:10.5555/1046920.1088699 · Cited by 259
Metadata
- Authors
- Vincent, P., & Bengio, Y.
- Venue
- Machine Learning
- Published
- 2002-07
- Volume
- 48
- Issue
- 1-3
- Pages
- 165-187
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2129809168
- Cited by
- 317
- References
- 35
- FWCI
- 13.24
- 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.