{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:06:21Z","timestamp":1780589181859,"version":"3.54.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1013955821559","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T13:55:48Z","timestamp":1041083748000},"page":"165-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":222,"title":["Kernel Matching Pursuit"],"prefix":"10.1007","volume":"48","author":[{"given":"Pascal","family":"Vincent","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoshua","family":"Bengio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"393395_CR1","first-page":"821","volume":"25","author":"M. Aizerman","year":"1964","unstructured":"Aizerman, M., Braverman, E., & Rozonoer, L. (1964). Theoretical foundations of the potential function method in pattern recognition learning. Automation and Remote Control, 25, 821\u2013837.","journal-title":"Automation and Remote Control"},{"key":"393395_CR2","doi-asserted-by":"crossref","unstructured":"Boser, B., Guyon, I., & Vapnik, V. (1992). An algorithm for optimal margin classifiers. In: Fifth Annual Workshop on Computational Learning Theory (pp. 144-152). Pittsburgh.","DOI":"10.1145\/130385.130401"},{"key":"393395_CR3","unstructured":"Chen, S. (1995). Basis Pursuit. Ph.D. Thesis, Department of Statistics, Stanford University."},{"issue":"2","key":"393395_CR4","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/72.80341","volume":"2","author":"S. Chen","year":"1991","unstructured":"Chen, S., Cowan, F., & Grant, P. (1991). Orthogonal least squares learning algorithm for radial basis function networks. IEEE Transactions on Neural Networks, 2:2, 302\u2013309.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"7","key":"393395_CR5","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1117\/12.173207","volume":"33","author":"G. Davis","year":"1994","unstructured":"Davis, G., Mallat, S., & Zhang, Z. (1994). Adaptive time-frequency decompositions. Optical Engineering, 33:7, 2183\u20132191.","journal-title":"Optical Engineering"},{"issue":"3","key":"393395_CR6","first-page":"269","volume":"21","author":"S. Floyd","year":"1995","unstructured":"Floyd, S., & Warmuth, M. (1995). Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, 21:3, 269\u2013304.","journal-title":"Machine Learning"},{"key":"393395_CR7","unstructured":"Freund, Y., & Schapire, R. E. (1996). Experiments with a new boosting algorithm. In Machine Learning: Proceedings of Thirteenth International Conference (pp. 148-156)."},{"key":"393395_CR8","first-page":"209","volume-title":"Proc. 11th Annu. Conf. on Comput. Learning Theory","author":"Y. Freund","year":"1998","unstructured":"Freund, Y., & Schapire, R. E. (1998). Large margin classification using the perceptron algorithm. In Proc. 11th Annu. Conf. on Comput. Learning Theory (pp. 209\u2013217). New York, NY: ACM Press."},{"key":"393395_CR9","unstructured":"Friedman, J. (1999). Greedy function approximation: A gradient boosting machine. IMS 1999 Reitz Lecture, February 24, 1999, Department of Statistics, Stanford University."},{"key":"393395_CR10","unstructured":"Friedman, J., Hastie, T., & Tibshirani, R. (1998). Additive logistic regression: A statistical view of boosting. Technical Report, Aug. 1998, Department of Statistics, Stanford University."},{"key":"393395_CR11","first-page":"849","volume-title":"Eighth International Conference on Pattern Recognition. Paris, 1986","author":"S. Gallant","year":"1986","unstructured":"Gallant, S. (1986). Optimal linear discriminants. In Eighth International Conference on Pattern Recognition. Paris, 1986 (pp. 849\u2013852). New York: IEEE."},{"key":"393395_CR12","unstructured":"Graepel, T., Herbrich, R., & Shawe-Taylor, J. (2000). Generalization error bounds for sparse linear classifiers. In Proceeding of the Thirteenth Annual Conference on Computational Learning Theory (pp. 298-303). Morgan Kaufmann."},{"issue":"1\/2\/3","key":"393395_CR13","first-page":"137","volume":"48","author":"S. Gunn","year":"2002","unstructured":"Gunn, S., & Kandola, J. (2002). Structural modelling with sparse kernels. Machine Learning special issue on New Methods for Model Combination and Model Selection, 48:1\/2\/3, 137\u2013163.","journal-title":"Machine Learning special issue on New Methods for Model Combination and Model Selection"},{"key":"393395_CR14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/3-540-49430-8_2","volume-title":"Neural networks: Tricks of the trade","author":"Y. LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Orr, G., & M\u00fcller, K.-R. (1998). Efficient backprop. In G. Orr & K.-R. M\u00fcller (Eds.), Neural networks: Tricks of the trade (pp. 9\u201350). Berlin: Springer."},{"issue":"3","key":"393395_CR15","first-page":"1269","volume":"21","author":"N. Littlestone","year":"1986","unstructured":"Littlestone, N., & Warmuth, M. (1986). Relating data compression and learnability. Unpublished manuscript. University of California Santa Cruz. An extended version can be found in Machine Learning, 21:3, 1269\u2013304.","journal-title":"Machine Learning"},{"issue":"12","key":"393395_CR16","doi-asserted-by":"crossref","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S. Mallat","year":"1993","unstructured":"Mallat, S., & Zhang, Z. (1993). Matching pursuit with time-frequency dictionaries. IEEE Trans. Signal Proc., 41:12, 3397\u20133415.","journal-title":"IEEE Trans. Signal Proc."},{"key":"393395_CR17","unstructured":"Mason, L., Baxter, J., Bartlett, P., & Frean, M. (2000). Boosting algorithms as gradient descent. In S. A. Solla, T. K. Leen, and K.-R. M\u00fcller (Eds.), Advances in neural information processing systems (Vol. 12) (pp. 512-518). MIT Press."},{"key":"393395_CR18","first-page":"307","volume-title":"Advances in neural information processing systems","author":"C. Nadeau","year":"2000","unstructured":"Nadeau, C., & Bengio, Y. (2000). Inference for the generalization Error. In S. A. Solla, T. K. Leen, and K.-R. M\u00fcller (Eds.), Advances in neural information processing systems (Vol. 12) (pp. 307\u2013313). Cambridge, MA: MIT Press."},{"key":"393395_CR19","doi-asserted-by":"crossref","unstructured":"Pati,Y., Rezaiifar, R., & Krishnaprasad, P. (1993). Orthogonal matching pursuit: Recursive function approximation with applications towavelet decomposition. In Proceedings of the 27th Annual Asilomar Conference on Signals, Systems, and Computers (pp. 40-44).","DOI":"10.1109\/ACSSC.1993.342465"},{"issue":"6","key":"393395_CR20","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1162\/089976698300017250","volume":"10","author":"T. Poggio","year":"1998","unstructured":"Poggio, T., & Girosi, F. (1998). A sparse representation for function approximation. Neural Computation, 10:6, 1445\u20131454.","journal-title":"Neural Computation"},{"key":"393395_CR21","unstructured":"Rasmussen, C., Neal, R., Hinton, G., van Camp, D., Ghahramani, Z., Kustra, R., & Tibshirani, R. (1996). The DELVE manual. DELVE can be found at http:\/\/www.cs.toronto.edu\/~delve"},{"key":"393395_CR22","series-title":"Technical Report 85-460-1","volume-title":"The perceptron-a perceiving and recognizing automaton","author":"F. Rosenblatt","year":"1957","unstructured":"Rosenblatt, F. (1957). The perceptron-a perceiving and recognizing automaton. Technical Report 85-460-1, Cornell Aeronautical Laboratory, Ithaca, N.Y."},{"issue":"5","key":"393395_CR23","first-page":"1651","volume":"26","author":"R. E. Schapire","year":"1998","unstructured":"Schapire, R. E., Freund, Y., Bartlett, P., & Lee, W. S. (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics, 26:5, 1651\u20131686.","journal-title":"The Annals of Statistics"},{"key":"393395_CR24","doi-asserted-by":"crossref","first-page":"2758","DOI":"10.1109\/78.650102","volume":"45","author":"B. Sch\u00f6lkopf","year":"1997","unstructured":"Sch\u00f6lkopf, B., Sung, K., Burges, C., Girosi, F., Niyogi, P., Poggio, T., & Vapnik, V. (1997). Comparing support vector machines with Gaussian kernels to radial basis function classifiers. IEEE Transactions on Signal Processing, 45, 2758\u20132765.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"5","key":"393395_CR25","doi-asserted-by":"crossref","first-page":"1926","DOI":"10.1109\/18.705570","volume":"44","author":"J. Shawe-Taylor","year":"1998","unstructured":"Shawe-Taylor, J., Bartlett, P., Williamson, R., & Anthony, M. (1998). Structural risk minimization over datadependent hierarchies. IEEE Transactions on Information Theory, 44:5, 1926\u20131940.","journal-title":"IEEE Transactions on Information Theory"},{"key":"393395_CR26","unstructured":"Singer, Y. (2000). Leveraged vector machines. In S. A. Solla, T. K. Leen, & K.-R. M\u00fcller (Eds.), Advances in neural information processing systems (Vol. 12) (pp. 610-616). MIT Press."},{"key":"393395_CR27","unstructured":"Smola, A. J., & Bartlett, P. (2001). Sparse greedy gaussian process regression. In Advances in neural information processing systems (Vol. 13)."},{"key":"393395_CR28","unstructured":"Smola, A. J., Friess, T., & Sch\u00f6lkopf, B. (1999). Semiparametric support vector and linear programming machines. In M.Kearns, S. Solla, & D. Cohn (Eds.), Advances in neural information processing systems (Vol. 11) (pp. 585-591). MIT Press."},{"key":"393395_CR29","first-page":"911","volume-title":"International Conference on Machine Learning","author":"A. Smola","year":"2000","unstructured":"Smola, A., & Sch\u00f6lkopf, B. (2000). Sparse greedy matrix approximation for machine learning. In P. Langley (Ed.), International Conference on Machine Learning (pp. 911\u2013918). San Francisco: Morgan Kaufmann."},{"key":"393395_CR30","first-page":"652","volume-title":"Advances in neural information processing systems (Vol. 12)","author":"M. Tipping","year":"2000","unstructured":"Tipping, M. (2000). The relevance vector machine. In S. A. Solla, T. K. Leen, & K.-R. M\u00fcller (Eds.), Advances in neural information processing systems (Vol. 12) (pp. 652\u2013658). Cambridge, MA: MIT Press."},{"key":"393395_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning theory","author":"V. Vapnik","year":"1995","unstructured":"Vapnik, V. (1995). The nature of statistical learning theory. New York: Springer."},{"key":"393395_CR32","series-title":"Lecture Notes in Economics and Mathematical Systems","volume-title":"Statistical learning theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V. (1998). Statistical learning theory. New York: Wiley. Lecture Notes in Economics and Mathematical Systems, Vol. 454."},{"key":"393395_CR33","first-page":"293","volume-title":"Advances in kernel methods-support vector learning","author":"J. Weston","year":"1999","unstructured":"Weston, J., Gammerman, A., Stitson, M., Vapnik, V., Vovk, V., & Watkins, C. (1999). Density estimation using support vector machines. In B. Sch\u00f6lkopf, C. J. C. Burges, & A. J. Smola (Eds.), Advances in kernel methods-support vector learning (pp. 293\u2013306). Cambridge, MA: MIT Press."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013955821559.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013955821559\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013955821559.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:31:16Z","timestamp":1752147076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013955821559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["393395"],"URL":"https:\/\/doi.org\/10.1023\/a:1013955821559","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}