Abstract: Community mining of complex information networks is a research hotspot in recent years and the detection of overlapping communities has important practical significance. The traditional community detection method accurately divides all nodes into each subclass to form a non-overlapping partition. However, the hard partitioning method is more difficult to deal with complex situations involving uncertain information and noise information. At present, there are few researches on the method of network embedding for overlapping community detection. Aiming at the problems of community drift and boundary uncertainty, a network embedding community detection method based on rough granulation is proposed. The node representation of structure information and attribute information is obtained through network embedding, and the similar nodes are mapped to the low-dimensional continuous vector space with similar distances. Then, the network structure and multi-level information with rough granulation to deal with the uncertainty areas are considered, and overlapping communities are finally generated. The experimental results in network public datasets and synthetic datasets show that the RGNE(network embedding based on rough granulation)method has higher precision and can effectively deal with community detection problems of uncertain networks. Finally, the parameter settings affecting the experimental results are discussed and analyzed in detail.

Key words: community detection, overlapping community, community drift, network embedding, rough granulation