Sciweavers

79 search results - page 5 / 16
» Convex multi-task feature learning
Sort
View
ICML
2006
IEEE
14 years 11 months ago
A DC-programming algorithm for kernel selection
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
JMLR
2008
169views more  JMLR 2008»
13 years 11 months ago
Multi-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernel...
Jieping Ye, Shuiwang Ji, Jianhui Chen
ICML
2007
IEEE
14 years 11 months ago
Direct convex relaxations of sparse SVM
Although support vector machines (SVMs) for binary classification give rise to a decision rule that only relies on a subset of the training data points (support vectors), it will ...
Antoni B. Chan, Nuno Vasconcelos, Gert R. G. Lanck...
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
14 years 10 days ago
A RELIEF Based Feature Extraction Algorithm
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
Yijun Sun, Dapeng Wu
NIPS
2001
14 years 8 days ago
Learning Lateral Interactions for Feature Binding and Sensory Segmentation
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
Heiko Wersing