关键词: 社区查询, 局部社区发现, Skip-gram模型, 节点相似度

Abstract: The huge size and complex structure of the social network make it impossible to explore the community structure of the whole network. Therefore, the community search, which focuses on the local community structure, has important research significance. Previous community-search algorithms usually combine irrelevant structures into the target community. This paper uses the Skip-gram model to learn the latent representations of networks, and uses the new goodness metric of community which combines the similarity and degree of the nodes together to find the target community. The experiments on real networks demonstrate the accuracy and consistency of the new algorithm.

Key words: community search, local community detection, Skip-gram, similarity of nodes