Improved algorithms for the random cluster graph model

doi:10.1002/rsa.20181

Improved algorithms for the random cluster graph model

2007-08-13

0

PRE

AI

DOI：10.1002/rsa.20181

原文链接

原文求助

摘要

En 中文

AbstractWe model noisy clustering data using random graphs: Clusters correspond to disjoint sets of vertices. Two vertices from the same set (resp., different sets) share an edge with probability p (resp., r < p). We give algorithms that reconstruct the clusters from the graph with high probability. Compared to previous studies, our algorithms have lower time complexity and apply under wider parameter range. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007

Improved algorithms for the random cluster graph model

摘要

期刊

机构

引用论文