A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
In the Correlation Clustering problem, we are given a complete weighted graph G with its edges labeled as "similar" and "dissimilar" by a noisy binary classifier. For a clustering 𝒞 of graph G, a similar edge is in disagreement with 𝒞, if its endpoints belong to distinct clusters; and a dissimilar edge is in disagreement with 𝒞 if its endpoints belong to the same cluster. The disagreements vector, dis, is a vector indexed by the vertices of G such that the v-th coordinate dis_v equals thearXiv:2108.05697v1 fatcat:atq4xysqzrdnnl2rxqokk7vuqm