摘要
近几年,基于社会关系网络的研究得到了社会各界的广泛关注。在社会关系网络中往往存在不同类型角色,其影响力与行为表现也不同。根据国家自然科学基金(以下简称“基金”)历史的20年申请信息中的申请人与参与人构成的项目合作关系,将其映射到社会关系网络中,挖掘其中有影响力的申请人,由此导出关系网络中的核心社团发现。为了更好地展示、处理这种大型社会网络,提出一种基于贪心策略的核心社团发现算法。与现有算法进行比较,结果显示该算法略优于目前的几种算法。
In recent years,the research based on the social network has received wide attention from all walks of life.There are often different types of roles in social networks,and their influence and behavior are also different.According to the project cooperation relationship between applicants and participants in the 20 years of application information of the National Natural Science Foundation of China(hereinafter referred to as“the fund”),this paper maps it to the social relationship network to dig out the influential applicants,and then leads to the core community discovery in the relationship network.In order to better display and deal with such large-scale social network,this paper proposes a core community discovery algorithm based on the greedy strategy.Compared with the existing algorithms,the proposed algorithm is slightly better than the current ones.
作者
王其冬
李东
周艳春
何贤芒
Wang Qidong;Li Dong;Zhou Yanchun;He Xianmang(School of Business,Ningbo University,Ningbo 315200,Zhejiang,China;Information Center,National Natural Science Foundation of China,Beijing 100085,China;School of Business,Liaoning University,Shenyang 110036,Liaoning,China;School of Cyberspace Science,Dongguan University of Technology,Dongguan 523808,Guangdong,China)
出处
《计算机应用与软件》
北大核心
2020年第3期173-177,224,共6页
Computer Applications and Software
基金
国家自然科学基金项目(61672303)
教育部人文社会科学研究项目(15YJA630069)。
关键词
社会关系网络
项目合作
核心社团
社团结构
Social network
Project cooperation
Core community
Community structure
