The Community for Technology Leaders
Green Image
Issue No. 01 - January (2007 vol. 29)
ISSN: 0162-8828
pp: 167-172
We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set of vertices, a notion introduced here which generalizes that of a maximal complete subgraph to edge-weighted graphs. We establish a correspondence between dominant sets and the extrema of a quadratic form over the standard simplex, thereby allowing the use of straightforward and easily implementable continuous optimization techniques from evolutionary game theory. Numerical examples on various point-set and image segmentation problems confirm the potential of the proposed approach.
Clustering, quadratic optimization, evolutionary game dynamics, image segmentation, perceptual organization.
Marcello Pelillo, Massimiliano Pavan, "Dominant Sets and Pairwise Clustering", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 29, no. , pp. 167-172, January 2007, doi:10.1109/TPAMI.2007.10
105 ms
(Ver 3.3 (11022016))