Sciweavers

60 search results - page 6 / 12
» Convex Relaxations for Subset Selection
Sort
View
ICML
2004
IEEE
14 years 8 months ago
Multi-task feature and kernel selection for SVMs
We compute a common feature selection or kernel selection configuration for multiple support vector machines (SVMs) trained on different yet inter-related datasets. The method is ...
Tony Jebara
FUIN
2006
113views more  FUIN 2006»
13 years 7 months ago
Adaptive Merging of Prioritized Knowledge Bases
Abstract. In this paper, we propose an adaptive algorithm for merging n (n2) prioritized knowledge bases which takes into account the degrees of conflict and agreement among these ...
Weiru Liu, Guilin Qi, David A. Bell

Publication
210views
14 years 2 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
ICML
2010
IEEE
13 years 8 months ago
Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets
A sparse representation of Support Vector Machines (SVMs) with respect to input features is desirable for many applications. In this paper, by introducing a 0-1 control variable t...
Mingkui Tan, Li Wang, Ivor W. Tsang
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...