Sciweavers

119 search results - page 10 / 24
» Sparse kernel methods for high-dimensional survival data
Sort
View
TSP
2008
89views more  TSP 2008»
13 years 8 months ago
The Kernel Least-Mean-Square Algorithm
The combination of the famed kernel trick and the least-mean-square (LMS) algorithm provides an interesting sample by sample update for an adaptive filter in reproducing Kernel Hil...
Weifeng Liu, Puskal P. Pokharel, Jose C. Principe
IWANN
2009
Springer
14 years 3 months ago
Feature Selection in Survival Least Squares Support Vector Machines with Maximal Variation Constraints
This work proposes the use of maximal variation analysis for feature selection within least squares support vector machines for survival analysis. Instead of selecting a subset of ...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...
TSP
2008
151views more  TSP 2008»
13 years 8 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 8 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
ICANN
2007
Springer
14 years 9 days ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel