暂无分享,去创建一个
Hervé Glotin | Liva Ralaivola | Pierre Machart | Thomas Peel | Sandrine Anthoine | H. Glotin | Pierre Machart | L. Ralaivola | Thomas Peel | S. Anthoine
[1] V. V. Vasin. Relationship of several variational methods for the approximate solution of ill-posed problems , 1970 .
[2] Subhransu Maji,et al. Fast and Accurate Digit Classification , 2009 .
[3] N. Aronszajn. Theory of Reproducing Kernels. , 1950 .
[4] A. E. Hoerl,et al. Ridge Regression: Applications to Nonorthogonal Problems , 1970 .
[5] Chih-Jen Lin,et al. A dual coordinate descent method for large-scale linear SVM , 2008, ICML '08.
[6] Matthias W. Seeger,et al. Using the Nyström Method to Speed Up Kernel Machines , 2000, NIPS.
[7] Petros Drineas,et al. On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..
[8] Bernhard Schölkopf,et al. Sparse Greedy Matrix Approximation for Machine Learning , 2000, International Conference on Machine Learning.
[9] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[10] Gunnar Rätsch,et al. Input space versus feature space in kernel-based methods , 1999, IEEE Trans. Neural Networks.
[11] Yurii Nesterov,et al. Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems , 2012, SIAM J. Optim..
[12] Ameet Talwalkar,et al. Ensemble Nystrom Method , 2009, NIPS.