1393 search results - page 190 / 279 » Machine Learning by Function Decomposition |
100
click to vote
ICML
2004
IEEE
16 years 2 months ago
2004
IEEE
Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
123
Voted
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
103
click to vote
ECML
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we address a method of source separation in the case where sources have certain temporal structures. The key contribution in this paper is to incorporate Gaussian pro...
130
click to vote
ICML
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
COLT
2006
Springer
15 years 5 months ago
2006
Springer
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...