基于合作博弈论的社会网络关键节点发现研究  

Discovering Critical Nodes in Social Networks Based on Cooperative Games

作　　者：王学光[1] 

机构地区：[1]华东政法大学信息科学与技术系,上海201620

出　　处：《计算机科学》2013年第4期155-159,共5页Computer Science

基　　金：国家社会科学基金项目(11BFX125)资助

摘　　要：社会网络关键节点发现问题有着许多重要的应用,同时也越来越受到了研究机构和学者的关注。为了找到社会网络中top K个关键节点,提出了一种基于合作博弈理论的方法。该方法考虑到社会网络普遍存在社区结构,利用Owen值得到每个节点的边际贡献,由此得到该问题的解。在2个合成数据集和4个实际数据集上验证了本方法的可行性和较其他方法的有效性。Discovering critical nodes in social networks has many important applications and more and more institutions and scholars have been attended.For finding out the top K critical nodes in social networks,this paper presented a method based on cooperative games to obtain each node＇s marginal contribution by using Owen value and considering the widespread community structure in social networks.And then we can get the solution of the critical nodes problem.The feasibility and effectiveness of our method were verified on two synthetic datasets and four real datasets.

关 键 词：社会网络 关键节点问题 合作博弈论 Owen值 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]