Local and global sparse Gaussian process approximations
暂无分享,去创建一个
[1] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[2] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[3] Tomás Feder,et al. Optimal algorithms for approximate clustering , 1988, STOC '88.
[4] Volker Tresp,et al. A Bayesian Committee Machine , 2000, Neural Computation.
[5] Carl E. Rasmussen,et al. Infinite Mixtures of Gaussian Process Experts , 2001, NIPS.
[6] Lehel Csató,et al. Sparse On-Line Gaussian Processes , 2002, Neural Computation.
[7] Neil D. Lawrence,et al. Fast Forward Selection to Speed Up Sparse Gaussian Process Regression , 2003, AISTATS.
[8] Larry S. Davis,et al. Efficient Kernel Machines Using the Improved Fast Gauss Transform , 2004, NIPS.
[9] Carl E. Rasmussen,et al. A Unifying View of Sparse Approximate Gaussian Process Regression , 2005, J. Mach. Learn. Res..
[10] Zoubin Ghahramani,et al. Sparse Gaussian Processes using Pseudo-inputs , 2005, NIPS.
[11] M. Opper. Sparse Online Gaussian Processes , 2008 .
[12] Carl E. Rasmussen,et al. Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.