Parallel Correlation Clustering on Big Graphs Parallel Correlation Clustering on Big Graphs
Paper summary This work addresses an important special case of the correlation clustering problem: Given as input a graph with edges labeled -1 (disagreement) or +1 (agreement), the goal is to decompose the graph so as to maximize agreement within components. Building on recent work \cite{conf/kdd/BonchiGL14} \cite{conf/kdd/ChierichettiDK14}, this paper contributes two concurrent algorithms, a proof of their approximation ratio, a run-time analysis as well as a set of experiments which demonstrate convincingly the advantage of the proposed algorithms over the state of the art.

Summary by NIPS Conference Reviews 5 years ago
Your comment: allows researchers to publish paper summaries that are voted on and ranked!

Sponsored by: and