ResearchTrend.AI
Two provably consistent divide and conquer clustering algorithms for large networks

Two provably consistent divide and conquer clustering algorithms for large networks

Soumendu Sundar Mukherjee
Purnamrita Sarkar
Peter J. Bickel
ArXiv (abs)PDFHTML

Papers citing "Two provably consistent divide and conquer clustering algorithms for large networks"

2 / 2 papers shown
Title
Graph sub-sampling for divide-and-conquer algorithms in large networks
Graph sub-sampling for divide-and-conquer algorithms in large networks
Eric Yanchenko
55
1
0
11 Sep 2024
Covariate Regularized Community Detection in Sparse Graphs
Covariate Regularized Community Detection in Sparse Graphs
Bowei Yan
Purnamrita Sarkar
72
55
0
10 Jul 2016

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.