Corpus ID: 1928684

Parallel Correlation Clustering on Big Graphs

  title={Parallel Correlation Clustering on Big Graphs},
  author={Xinghao Pan and Dimitris Papailiopoulos and S. Oymak and B. Recht and K. Ramchandran and Michael I. Jordan},
  • Xinghao Pan, Dimitris Papailiopoulos, +3 authors Michael I. Jordan
  • Published in NIPS 2015
  • Computer Science, Mathematics
  • 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, KwikCluster in practice 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… CONTINUE READING
    47 Citations
    Motif and Hypergraph Correlation Clustering
    • 10
    • PDF
    Edge partitioning of large graphs
    Correlation Clustering in Data Streams
    • 45
    • PDF
    Correlation Clustering and Biclustering With Locally Bounded Errors
    • 22
    • PDF
    Parallelism in Randomized Incremental Algorithms
    • 21
    • PDF
    Parallelism in Randomized Incremental Algorithms
    Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering
    • 5
    • PDF
    Motif clustering and overlapping clustering for social network analysis
    • 27
    • PDF


    Correlation clustering in general weighted graphs
    • 235
    • PDF
    Chromatic correlation clustering
    • 22
    • PDF
    Correlation clustering with a fixed number of clusters
    • 135
    • PDF
    Correlation clustering in MapReduce
    • 41
    • Highly Influential
    Correlation clustering
    • N. Bansal, A. Blum, S. Chawla
    • Computer Science, Mathematics
    • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
    • 2002
    • 133
    • PDF
    Correlation clustering: from theory to practice
    • 17
    • PDF
    Greedy sequential maximal independent set and matching are parallel on average
    • 75
    • PDF
    Correlation Clustering: maximizing agreements via semidefinite programming
    • C. Swamy
    • Computer Science, Mathematics
    • SODA '04
    • 2004
    • 138
    • PDF