| 注册
首页|期刊导航|计算机工程与应用|基于Skip-gram模型的社区查询算法

基于Skip-gram模型的社区查询算法

廖宇 朱福喜 刘世超

计算机工程与应用2018,Vol.54Issue(8):143-148,6.
计算机工程与应用2018,Vol.54Issue(8):143-148,6.DOI:10.3778/j.issn.1002-8331.1611-0528

基于Skip-gram模型的社区查询算法

Community search based on Skip-gram

廖宇 1朱福喜 1刘世超2

作者信息

  • 1. 武汉大学 计算机学院,武汉430072
  • 2. 汉口学院 计算机科学与技术学院,武汉430212
  • 折叠

摘要

Abstract

The huge size and complex structure of the social network make it impossible to explore the community struc-ture of the whole network.Therefore,the community search,which focuses on the local community structure,has impor-tant 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 good-ness 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.

关键词

社区查询/局部社区发现/Skip-gram模型/节点相似度

Key words

community search/local community detection/Skip-gram/similarity of nodes

分类

信息技术与安全科学

引用本文复制引用

廖宇,朱福喜,刘世超..基于Skip-gram模型的社区查询算法[J].计算机工程与应用,2018,54(8):143-148,6.

基金项目

国家自然科学基金(No.61272277). (No.61272277)

计算机工程与应用

OA北大核心CSCDCSTPCD

1002-8331

访问量4
|
下载量0
段落导航相关论文