Skip to main content

Mercer’s Theorem, Feature Maps, and Smoothing

  • Conference paper
Learning Theory (COLT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4005))

Included in the following conference series:

Abstract

We study Mercer’s theorem and feature maps for several positive definite kernels that are widely used in practice. The smoothing properties of these kernels will also be explored.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aronszajn, N.: Theory of Reproducing Kernels. Transactions of the American Mathematical Society 68, 337–404 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  2. Belkin, M., Niyogi, P., Sindwani, V.: Manifold Regularization: a Geometric Framework for Learning from Examples. University of Chicago Computer Science Technical Report TR-2004-06 (2004) (accepted for publication)

    Google Scholar 

  3. Belkin, M., Niyogi, P.: Semi-supervised Learning on Riemannian Manifolds. Machine Learning, Special Issue on Clustering 56, 209–239 (2004)

    MATH  Google Scholar 

  4. De Vito, E., Caponnetto, A., Rosasco, L.: Model Selection for Regularized Least-Squares Algorithm in Learning Theory. Foundations of Computational Mathematics 5(1), 59–85 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lafferty, J., Lebanon, G.: Diffusion Kernels on Statistical Manifolds. Journal of Machine Learning Research 6, 129–163 (2005)

    MathSciNet  Google Scholar 

  6. Müller, C.: Analysis of Spherical Symmetries in Euclidean Spaces. In: Applied Mathematical Sciences 129. Springer, New York (1997)

    Google Scholar 

  7. Schölkopf, B., Smola, A.J.: Learning with Kernels. The MIT Press, Cambridge, Massachusetts (2002)

    Google Scholar 

  8. Smale, S., Zhou, D.X.: Learning Theory Estimates via Integral Operators and Their Approximations (to appear, 2005)

    Google Scholar 

  9. Smola, A.J., Ovari, Z.L., Williamson, R.C.: Regularization with Dot-Product Kernels. In: Advances in Information Processing Systems (2000)

    Google Scholar 

  10. Steinwart, I., Hush, D., Scovel, C.: An Explicit Description of the Reproducing Kernel Hilbert Spaces of Gaussian RBF Kernels Kernels. Los Alamos National Laboratory Technical Report LA-UR-04-8274 (December 2005)

    Google Scholar 

  11. Wahba, G.: Spline Interpolation and Smoothing on the Sphere. SIAM Journal of Scientific and Statistical Computing 2, 5–16 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wahba, G.: Spline Models for Observational Data. CBMS-NSF Regional Conference Series in Applied Mathematics 59, Society for Industrial and Applied Mathematics, Philadelphia (1990)

    Google Scholar 

  13. Watson, G.N.: A Treatise on the Theory of Bessel Functions, 2nd edn. Cambridge University Press, Cambridge, England (1944)

    MATH  Google Scholar 

  14. Zhou, D.X.: The Covering Number in Learning Theory. Journal of Complexity 18, 739–767 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minh, H.Q., Niyogi, P., Yao, Y. (2006). Mercer’s Theorem, Feature Maps, and Smoothing. In: Lugosi, G., Simon, H.U. (eds) Learning Theory. COLT 2006. Lecture Notes in Computer Science(), vol 4005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776420_14

Download citation

  • DOI: https://doi.org/10.1007/11776420_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35294-5

  • Online ISBN: 978-3-540-35296-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics