资源分类
》 资源 》论文》Community Detection via Measure Space Embedding

Community Detection via Measure Space Embedding

2020-02-04 | |  60 |   46 |   0

Abstract

 We present a new algorithm for community detection. The algorithm uses random walks to embed the graph in a space of measures, after which a modification of k-means in that space is applied. The algorithm is therefore fast and easily parallelizable. We evaluate the algorithm on standard random graph benchmarks, including some overlapping community benchmarks, and find its performance to be better or at least as good as previously known algorithms. We also prove a linear time (in number of edges) guarantee for the algorithmq on a p, q-stochastic 1 1 block model with where image.png

上一篇：Color Constancy by Learning to Predict Chromaticity from Luminance

下一篇：The Consistency of Common Neighbors for Link Prediction in Stochastic Blockmodels

用户评价
全部评价

热门资源

  • 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...