资源分类
》 资源 》论文》Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering

Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering

2020-02-27 | |  73 |   43 |   0

Abstract

We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n图片.pngn + m log n) time on graphs with n vertices and m edges, and (b) with high probability, finds all “large enough” clusters in a random graph generated according to the planted partition model. We provide lower bounds that imply that our “large enough” constraint cannot be improved much, even using a computationally unbounded algorithm. We describe some experiments running the algorithm and a few related algorithms on random graphs with partitions generated using a Chinese Restaurant Processes, and some results of applying the algorithm to cluster DBLP titles.

上一篇：Comparing Clusterings in Space

下一篇：Clustering processes

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...