Sciweavers

175 search results - page 4 / 35
» A DC-programming algorithm for kernel selection
Sort
View
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
JMLR
2010
129views more  JMLR 2010»
13 years 3 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
ICML
2008
IEEE
14 years 9 months ago
Localized multiple kernel learning
Recently, instead of selecting a single kernel, multiple kernel learning (MKL) has been proposed which uses a convex combination of kernels, where the weight of each kernel is opt...
Ethem Alpaydin, Mehmet Gönen
CSDA
2006
142views more  CSDA 2006»
13 years 8 months ago
A Bayesian approach to bandwidth selection for multivariate kernel density estimation
: Kernel density estimation for multivariate data is an important technique that has a wide range of applications. However, it has received significantly less attention than its un...
Xibin Zhang, Maxwell L. King, Rob J. Hyndman
ICML
2007
IEEE
14 years 9 months ago
Feature selection in a kernel space
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult ...
Bin Cao, Dou Shen, Jian-Tao Sun, Qiang Yang, Zheng...