Dominant sets and pairwise clustering

IEEE Trans Pattern Anal Mach Intell. 2007 Jan;29(1):167-72. doi: 10.1109/tpami.2007.250608.


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.

MeSH terms

  • Algorithms*
  • Artificial Intelligence*
  • Cluster Analysis*
  • Image Enhancement / methods*
  • Image Interpretation, Computer-Assisted / methods*
  • Information Storage and Retrieval / methods*
  • Pattern Recognition, Automated / methods*