Random Features for Large-Scale Kernel Machines
暂无分享,去创建一个
[1] W. Rudin,et al. Fourier Analysis on Groups. , 1965 .
[2] John C. Platt. Using Analytic QP and Sparseness to Speed Training of Support Vector Machines , 1998, NIPS.
[3] Alan M. Frieze,et al. Fast Monte-Carlo algorithms for finding low-rank approximations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[4] Felipe Cucker,et al. On the mathematical foundations of learning , 2001 .
[5] Bernhard Schölkopf,et al. Sampling Techniques for Kernel Methods , 2001, NIPS.
[6] Michael C. Ferris,et al. Interior-Point Methods for Massive Support Vector Machines , 2002, SIAM J. Optim..
[7] Dominic Mazzoni,et al. Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors , 2003, ICML.
[8] Larry S. Davis,et al. Efficient Kernel Machines Using the Improved Fast Gauss Transform , 2004, NIPS.
[9] Petros Drineas,et al. On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..
[10] Avrim Blum,et al. Random Projection, Margins, Kernels, and Feature-Selection , 2005, SLSFS.
[11] Ivor W. Tsang,et al. Core Vector Machines: Fast SVM Training on Very Large Data Sets , 2005, J. Mach. Learn. Res..
[12] Andrew Y. Ng,et al. Fast Gaussian Process Regression using KD-Trees , 2005, NIPS.
[13] Thorsten Joachims,et al. Training linear SVMs in linear time , 2006, KDD '06.
[14] Stéphane Canu,et al. Comments on the "Core Vector Machines: Fast SVM Training on Very Large Data Sets" , 2007, J. Mach. Learn. Res..
[15] Xiaojin Zhu. Random Projection , .