Sciweavers

119 search results - page 15 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
JMLR
2011
148views more  JMLR 2011»
13 years 3 months ago
Bayesian Generalized Kernel Mixed Models
We propose a fully Bayesian methodology for generalized kernel mixed models (GKMMs), which are extensions of generalized linear mixed models in the feature space induced by a repr...
Zhihua Zhang, Guang Dai, Michael I. Jordan
ICASSP
2011
IEEE
13 years 5 days 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
CVPR
2010
IEEE
14 years 4 months ago
Locally-Parametric Pictorial Structures
Pictorial structure (PS) models are extensively used for part-based recognition of scenes, people, animals and multi-part objects. To achieve tractability, the structure and param...
Benjamin Sapp, Chris Jordan, Ben Taskar
MICCAI
2005
Springer
14 years 9 months ago
Support Vector Clustering for Brain Activation Detection
In this paper, we propose a new approach to detect activated time series in functional MRI using support vector clustering (SVC). We extract Fourier coefficients as the features of...
Defeng Wang, Lin Shi, Daniel S. Yeung, Pheng-Ann H...
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
14 years 3 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