Sciweavers

604 search results - page 32 / 121
» Regularization and feature selection for networked features
Sort
View
ICML
2007
IEEE
16 years 4 months ago
Discriminant kernel and regularization parameter learning via semidefinite programming
Regularized Kernel Discriminant Analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. The performance of RKDA depends on the selection o...
Jieping Ye, Jianhui Chen, Shuiwang Ji
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
15 years 10 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
147
Voted
ACMSE
2010
ACM
14 years 10 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
ICANN
2009
Springer
15 years 1 months ago
Mining Rules for the Automatic Selection Process of Clustering Methods Applied to Cancer Gene Expression Data
Different algorithms have been proposed in the literature to cluster gene expression data, however there is no single algorithm that can be considered the best one independently on...
André C. A. Nascimento, Ricardo Bastos Cava...
117
Voted
ICML
2006
IEEE
16 years 4 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...