Sciweavers

1093 search results - page 10 / 219
» Clustering from Constraint Graphs
Sort
View
125
Voted
ALT
2007
Springer
15 years 3 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
CCS
2009
ACM
16 years 7 days ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
87
Voted
ICPR
2008
IEEE
15 years 6 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang
106
Voted
CVPR
2008
IEEE
16 years 1 months ago
Constrained spectral clustering through affinity propagation
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 ...
Miguel Á. Carreira-Perpiñán, ...
NIPS
2008
15 years 1 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman