14 search results - page 1 / 3 » Constrained spectral clustering through affinity propagation |
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
We propose a spectral learning approach to shape segmentation. The method is composed of a constrained spectral clustering algorithm that is used to supervise the segmentation of a...
ICDM
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--The Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007) provides an understandable, nearly optimal summary of a data set. However, it suffers...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...