Skip to content
conftrace_

graph clustering

210 papers

Papers

A Divide and Conquer Framework for Distributed Graph Clustering ICML 2015 Community Detection Using Time-Dependent Personalized PageRank ICML 2015 Correlation Clustering with Noisy Partial Information COLT 2015 Iterative and Active Graph Clustering Using Trace Norm Minimization Without Cluster Size Constraints JMLR 2015 Motion Trajectory Segmentation via Minimum Cost Multicuts ICCV 2015 Parallel Correlation Clustering on Big Graphs NeurIPS 2015 Recovering Communities in the General Stochastic Block Model Without Knowing the Parameters NeurIPS 2015 Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery COLT 2015 Axioms for Graph Clustering Quality Functions JMLR 2014 Belief propagation, robust reconstruction and optimal recovery of block models COLT 2014 Clustering from Labels and Time-Varying Graphs NeurIPS 2014 Clustering Partially Observed Graphs via Convex Optimization JMLR 2014 Community Detection via Random and Adaptive Sampling COLT 2014 Finding Dense Subgraphs via Low-Rank Bilinear Optimization ICML 2014 Graph Clustering With Missing Data: Convex Algorithms and Analysis NeurIPS 2014 Multi-Scale Spectral Decomposition of Massive Graphs NeurIPS 2014 Spectral Clustering of graphs with the Bethe Hessian NeurIPS 2014 Streaming, Memory Limited Algorithms for Community Detection NeurIPS 2014 Tight Continuous Relaxation of the Balanced k-Cut Problem NeurIPS 2014 Weighted Graph Clustering with Non-Uniform Uncertainties ICML 2014 A Gang of Bandits NeurIPS 2013 A Local Algorithm for Finding Well-Connected Clusters ICML 2013 Breaking the Small Cluster Barrier of Graph Clustering ICML 2013 Regularized Spectral Clustering under the Degree-Corrected Stochastic Blockmodel NeurIPS 2013 Unsupervised Link Selection in Networks AISTATS 2013