23 search results - page 1 / 5 » Convex Clustering with Exemplar-Based Models |
NIPS
2007
13 years 6 months ago
2007
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
ICML
2008
IEEE
14 years 5 months ago
2008
IEEE
A recent trend in exemplar based unsupervised learning is to formulate the learning problem as a convex optimization problem. Convexity is achieved by restricting the set of possi...
PAMI
2007
13 years 4 months ago
2007
—This paper presents a novel probabilistic approach to hierarchical, exemplar-based shape matching. No feature correspondence is needed among exemplars, just a suitable pairwise ...
NAACL
2010
13 years 2 months ago
2010
Current vector-space models of lexical semantics create a single "prototype" vector to represent the meaning of a word. However, due to lexical ambiguity, encoding word ...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
We propose an unsupervised image segmentation method based on texton similarity and mode seeking. The input image is first convolved with a filter-bank, followed by soft cluster...