【更新】社团检测（community detection）相关文献整理（2015-2018）

刚刚开始接触community detection相关的内容，在找资料和了解相关定义、算法的过程中发现自己的记录很混乱，所以借此记录下自己的一些学习过程，希望可以一起学习交流。

首先咱们来讨论一下文献查找，本文主要列出了机器学习、数据挖掘和人工智能领域的相关文献，我是直接搜索这些领域的相关会议，然后找到accepted papers，利用关键词（community）进行文章的查找和整理，当然也可以直接在百度学术、必应学术、谷歌学术等一系列搜索引擎中或者dblp之类的数据库利用关键词查找。其实深以为自己这样的查找方式有点低效，得一篇篇地看摘要，了解讲的啥才能知道是不是自己要找的文献，但是好像也没有更加高效的方法，毕竟要自己一步一步地去做，才能更了解。（所以我也不知道自己在说啥。。。）

好啦！现在来看看我选择的会议吧：

• 机器学习（NIPS, ICML, ECML, COLT）
• 数据挖掘（SIGKDD, ICDM, PAKDD, SDM, PKDD）
• 人工智能（IJCAI, AAAI）

这些会议是相关领域内一些比较重要的会议，当然还有许多非常好的会议，我这边列得不全，可以自行查找。

---

文章列表

1. 机器学习

2. Community Detection on Evolving Graphs,NIPS2016

   ”In this paper, we study a model of clustering on evolving graphs that captures this aspect of the problem. Our model is based on the classical stochastic block model, which has been used to assess rigorously the quality of various static clustering methods. In our model, the algorithm is supposed to reconstruct the planted clustering, given the ability to query for small pieces of local information about the graph, at a limited rate. ”

3. Community Detection via Measure Space Embedding,NIPS2015

   ”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. ”“We evaluate the algorithm on standard random graph benchmarks, including some overlapping community benchmarks.”

4. GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models,ICML2018

   However, modeling complex distributions over graphs and then efficiently sampling from these distributions is challenging due to the non-unique, high-dimensional nature of graphs and the complex, non-local dependencies that exist between edges in a given graph. Here we propose GraphRNN, a deep autoregressive model that addresses the above challenges and approximates any distribution of graphs with minimal assumptions about their structure. GraphRNN learns to generate graphs by training on a representative set of graphs and decomposes the graph generation process into a sequence of node and edge formations, conditioned on the graph structure generated so far.

5. Community Recovery in Graphs with Locality,ICML2016

   “we study the problem of community recovery in graphs with locality. In this problem, pairwise noisy measurements of whether two nodes are in the same community or different communities come mainly or exclusively from nearby nodes rather than uniformly sampled between all node pairs, as in m