122 search results - page 17 / 25 » Kernelization for Convex Recoloring |
110
Voted
AAAI
2010
15 years 4 months ago
2010
Multiple Kernel Learning (MKL) can be formulated as a convex-concave minmax optimization problem, whose saddle point corresponds to the optimal solution to MKL. Most MKL methods e...
114
click to vote
NIPS
2007
15 years 4 months ago
2007
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...
124
click to vote
NIPS
2008
15 years 4 months ago
2008
We present a multi-label multiple kernel learning (MKL) formulation in which the data are embedded into a low-dimensional space directed by the instancelabel correlations encoded ...
133
Voted
ICMLA
2009
15 years 1 months ago
2009
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
84
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We study positive measures that are solutions to an abstract optimisation problem, which is a generalisation of a classical variational problem with a constraint on infor...