Correlation clustering: A parallel approach?
暂无分享,去创建一个
Correlation clustering is a NP-hard problem, and for large graphs finding even just a good approximation of the optimal solution is a hard task. In previous articles we have suggested a contraction method and its divide and conquer variant. In this article we present several improvements of this method (preprocessing, quasi-parallelism, etc.) and prepare it for parallelism. Based on speed tests we show where it helps the concurrent execution, and where it pulls us back.
[1] László Aszalós,et al. Correlation clustering: divide and conquer , 2016, FedCSIS.
[2] László Aszalós,et al. Correlation Clustering by Contraction, a More Effective Method , 2016 .
[3] Z. Néda,et al. Phase transition in an optimal clusterization model , 2006 .
[4] Anthony Wirth,et al. Correlation Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.
[5] J. Zahn. Approximating Symmetric Relations by Equivalence Relations , 1964 .