多社交网络的影响力最大化分析  

Influence Maximization on Multiple Social Networks

作　　者：李国良[1] 楚娅萍 冯建华[1] 徐尧强[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《计算机学报》2016年第4期643-656,共14页Chinese Journal of Computers

基　　金：国家自然科学基金(61373024;61422205);国家"九七三"重点基础研究发展规划项目基金(2015CB358700)资助

摘　　要：影响力最大化旨在从网络中识别k个节点,使得通过这k个节点产生的影响传播范围最大.该问题在病毒营销领域具有重要的应用背景,它已经引起了学术界和工业界的广泛研究.该文作者观察到已有的研究工作大多数只是针对单一网络,即在给定的一个网络上识别k个节点使得其在该网络上产生最大的影响范围;然而,随着社交网络的普及,丰富多样的社交平台不断涌现,以满足不同的社交需求,这使得社交人群不被局限在一个网络内,而是分布在不同的社交网络上.这种变化的一个直接影响是使得基于病毒式营销的应用,例如单一网络上的产品推广愈加不能满足推广的广度需求,很可能是单一网络上的用户量不能达到推广的目标人群数量,又或者广告商期望在多个网络平台上找到k个用户以最大化影响传播范围.为此,在文中,作者研究多社交网络上的影响力最大化问题.该文首先仔细地研究了影响力最大化问题在单一网络和多社交网络上的不同,并提出了实体的自传播特性以在多个网络之间建立联系.之后,作者提出了多社交网络上的影响计算模型来建模节点间的影响力,然后扩展了基于树的算法模型以适应多社交网络上的影响力最大化问题.基于所提出的影响计算模型和扩展的基于树的算法模型,作者提出了多种策略的优化算法.例如通过深层次挖掘自模特性来避免冗余计算,通过使用影响增益上界近似准确的增益来加速种子选取过程等,最后通过真实数据集上的实验表明文中所提方法在性能和影响范围上都优于已有的算法.Influence Maximization aims to identify k nodes from a network such that the influence spread invoked by the k nodes is maximized.It has various real applications in viral-marketing areas and has been extensively studied by the academic and industrial communities.We observe that existing works all focus on a single network,which identifies k nodes that has the maximal influence spread on one given network;however,with the popularization of social networks,a variety of social platforms are emerged to fulfill various social needs,which leads that social populations will not be confined to a social network,and they will be distributed in different social networks.The direct issue is that the viral-marketing based applications,such as the product promotion on a single network can＇t meet the breadth demands of current marketing promotion,it＇s probably that the whole user of the network can＇t reach the number of targeted population,or the advertisers expect to maximize the influence spread on multiple social networks with k users.Compared with single network,more challenges come forth.It is challengeable to find k users that have the maximal influence spread on the multiple social networks,since it has been proven that influence maximization problem is NP hard.It is more complex to evaluate theinfluence strength between nodes,since the information propagation is more intricacy among multiple social networks.Besides,entity recognition has to be considered when analyze influence on multiple social networks,since it is normal for a person to have multiple social network accounts.With regards to these,in this paper,we study the influence maximization problem on multiple social networks.In summary,we study the differences of influence maximization between single network and multiple social networks carefully,and propose the self propagation property of entity to build relation among different networks.Later,we propose the influence calculation model to model the influence strength between nodes.We extend the tree-base

关 键 词：社交网络 影响力最大化 多社交网络 传播模型 影响力 社会媒体 数据挖掘 

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