资源分类
》 资源 》论文》Bipartite Stochastic Block Models with Tiny Clusters

Bipartite Stochastic Block Models with Tiny Clusters

2020-02-17 | |  65 |   58 |   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 image.png where n is the number of vertices in the graph and image.png Previous algorithms were only able to identify clusters of size image.png 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.

上一篇：Infinite-Horizon Gaussian Processes

下一篇：Interactive Structure Learning with Structural Query-by-Committee

用户评价
全部评价

热门资源

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...

  • Shape-based Autom...

    We present an algorithm for automatic detection...