TY - GEN

T1 - Improved algorithms for the random cluster graph model

AU - Shamir, Ron

AU - Tsur, Dekel

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2002.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - The following probabilistic process models the generation of noisy clustering data: Clusters correspond to disjoint sets of vertices in a graph. Each two vertices from the same set are connected by an edge with probability p, and each two vertices from different sets are connected by an edge with probability r < p. The goal of the clustering problem is to reconstruct the clusters from the graph. We give algorithms that solve this problem with high probability. Compared to previous studies, our algorithms have lower time complexity and wider parameter range of applicability. In particular, our algorithms can handle O(√n/log n) clusters in an n-vertex graph, while all previous algorithms require that the number of clusters is constant.

AB - The following probabilistic process models the generation of noisy clustering data: Clusters correspond to disjoint sets of vertices in a graph. Each two vertices from the same set are connected by an edge with probability p, and each two vertices from different sets are connected by an edge with probability r < p. The goal of the clustering problem is to reconstruct the clusters from the graph. We give algorithms that solve this problem with high probability. Compared to previous studies, our algorithms have lower time complexity and wider parameter range of applicability. In particular, our algorithms can handle O(√n/log n) clusters in an n-vertex graph, while all previous algorithms require that the number of clusters is constant.

UR - http://www.scopus.com/inward/record.url?scp=23044533396&partnerID=8YFLogxK

U2 - 10.1007/3-540-45471-3_24

DO - 10.1007/3-540-45471-3_24

M3 - Conference contribution

AN - SCOPUS:23044533396

SN - 9783540438663

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 230

EP - 239

BT - Algorithm Theory - SWAT 2002 - 8th Scandinavian Workshop on Algorithm Theory, Proceedings

A2 - Penttonen, Martti

A2 - Schmidt, Erik Meineche

PB - Springer Verlag

T2 - 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002

Y2 - 3 July 2002 through 5 July 2002

ER -