Timezone: »

 
Poster
Parallel Correlation Clustering on Big Graphs
Xinghao Pan · Dimitris Papailiopoulos · Samet Oymak · Benjamin Recht · Kannan Ramchandran · Michael Jordan

Tue Dec 08 04:00 PM -- 08:59 PM (PST) @ 210 C #66
in Poster Session »

Given a similarity graph between items, correlation clustering (CC) groups similar items together and dissimilar ones apart. One of the most popular CC algorithms is KwikCluster: an algorithm that serially clusters neighborhoods of vertices, and obtains a 3-approximation ratio. Unfortunately, in practice KwikCluster requires a large number of clustering rounds, a potential bottleneck for large graphs.We present C4 and ClusterWild!, two algorithms for parallel correlation clustering that run in a polylogarithmic number of rounds, and provably achieve nearly linear speedups. C4 uses concurrency control to enforce serializability of a parallel clustering process, and guarantees a 3-approximation ratio. ClusterWild! is a coordination free algorithm that abandons consistency for the benefit of better scaling; this leads to a provably small loss in the 3 approximation ratio.We provide extensive experimental results for both algorithms, where we outperform the state of the art, both in terms of clustering accuracy and running time. We show that our algorithms can cluster billion-edge graphs in under 5 seconds on 32 cores, while achieving a 15x speedup.

[ PDF] 

Author Information

Xinghao Pan (UC Berkeley)
Dimitris Papailiopoulos (UC Berkeley)
Samet Oymak (Caltech)
Benjamin Recht (UC Berkeley)
Kannan Ramchandran (UC Berkeley)
Michael Jordan (UC Berkeley)

More from the Same Authors