Bipartite Stochastic Block Models with Tiny Clusters
| 
56 | 
45 | 
0
Abstract
We study the problem of finding clusters in random bipartite graphs. We present a simple two-step algorithm which provably finds even tiny clusters of size 
where n is the number of vertices in the graph and 
Previous algorithms were only able to identify clusters of size 
We evaluate the algorithm on synthetic and on real-world data; the experiments show that the algorithm can find extremely small clusters even in presence of high destructive noise.
还没有评论，说两句吧！
热门资源
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
Learning to Predi...
Much of model-based reinforcement learning invo...
dynamical system ...
allows to preform manipulations of heavy or bul...
The Variational S...
Unlike traditional images which do not offer in...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
