Edge Representation Learning for Community Detection in Large Scale Information Networks.

It is found that networks in real world divide naturally into communities or modules. Many community detection algorithms have been developed to uncover the community structure in networks. However, most of them focus on non-overlapping communities and the applicability of these work is limited when it comes to real world networks, which inherently are overlapping in most cases, e.g. Facebook and Weibo. In this paper, we propose an overlapping community detection algorithm based on edge representation learning. Firstly, we sample a series of edge sequences using random walks on graph, then a mapping function from edge to feature vectors is automatically learned in an unsupervised way. At last we employ the traditional clustering algorithms, e.g. K-means and its variants, on the learned representations to carry out community detection. To demonstrate the effectiveness of our proposed method, extensive experiments are conducted on a group of synthetic networks and two real world networks with ground truth. Experiment results show that our proposed method outperforms traditional algorithms in terms of evaluation metrics.