165 search results - page 1 / 33 » Dominant Sets and Pairwise Clustering |
PAMI
2007
13 years 4 months ago
2007
—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 ...
NIPS
2004
13 years 6 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
The field of pairwise clustering is currently dominated by the idea of dividing a set of objects into disjoints classes, thereby giving rise to (hard) partitions of the input dat...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...