574 search results - page 18 / 115 » Maximum Margin Clustering |
NIPS
2007
13 years 9 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
DIS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
NIPS
2003
13 years 9 months ago
2003
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...