Mercer theorem for RKHS on noncompact sets
暂无分享,去创建一个
[1] Vladimir N. Vapnik,et al. The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.
[2] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[3] Federico Girosi,et al. An Equivalence Between Sparse Approximation and Support Vector Machines , 1998, Neural Computation.
[4] G. Wahba. Spline models for observational data , 1990 .
[5] Felipe Cucker,et al. On the mathematical foundations of learning , 2001 .
[6] Ding-Xuan Zhou,et al. Capacity of reproducing kernel spaces in learning theory , 2003, IEEE Transactions on Information Theory.
[7] Tomaso A. Poggio,et al. Regularization Networks and Support Vector Machines , 2000, Adv. Comput. Math..
[8] Ding-Xuan Zhou,et al. The covering number in learning theory , 2002, J. Complex..
[9] S. Smale,et al. ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY , 2003 .
[10] N. Aronszajn. Theory of Reproducing Kernels. , 1950 .
[11] Felipe Cucker,et al. Best Choices for Regularization Parameters in Learning Theory: On the Bias—Variance Problem , 2002, Found. Comput. Math..
[12] J. Mercer. Functions of Positive and Negative Type, and their Connection with the Theory of Integral Equations , 1909 .