Sciweavers

29 search results - page 1 / 6
» Sparse kernel learning with LASSO and Bayesian inference alg...
Sort
View
NN
2010
Springer
189views Neural Networks» more  NN 2010»
12 years 11 months ago
Sparse kernel learning with LASSO and Bayesian inference algorithm
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...
Junbin Gao, Paul W. Kwan, Daming Shi
ICML
2004
IEEE
14 years 5 months ago
Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
Zhihua Zhang, Dit-Yan Yeung, James T. Kwok
ICASSP
2011
IEEE
12 years 8 months ago
A sliding-window online fast variational sparse Bayesian learning algorithm
In this work a new online learning algorithm that uses automatic relevance determination (ARD) is proposed for fast adaptive nonlinear filtering. A sequential decision rule for i...
Thomas Buchgraber, Dmitriy Shutin, H. Vincent Poor
JMLR
2010
163views more  JMLR 2010»
12 years 11 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
13 years 11 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain