摘要: 影响力最大化问题的目标是寻找社交网络中一组种子结点集合,在给定的传播模型下,使得这些结点最终传播的影响范围最大。Kempe和Kleinberg提出的贪心算法可以获得很好的影响范围,但是因复杂度太高而并不适用于大型社交网络。Chen和Yuan等人基于线性阈值(LT)模型提出了构造局部有向无环图的启发式算法,但是LT模型只考虑了邻居结点的直接影响力,忽略了结点之间存在的间接影响力。因此,在LT模型的基础上,结合网络中结点之间存在的间接影响力,提出了LT+影响力模型,并利用构造局部有向无环图的启发式算法求解LT+模型的影响力最大化,称为LT+DAG算法。真实数据集上的对比实验表明,LT+DAG算法具有更好的影响范围以及较好的可扩展性。
[1] Kempe D,Kleinberg J,Tardos é.Maximizing the spread of influence through a social network[C]∥Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Disco-very and Data Mining.ACM,2003:137-146 [2] Kimura M,Saito K.Tractable models for information diffusion in social networks[M]∥Knowledge Discovery in Databases:PKDD 2006.Springer Berlin Heidelberg,2006:259-271 [3] Leskovec J,Krause A,Guestrin C,et al.Cost-effective outbreak detection in networks[C]∥Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2007:420-429 [4] Goyal A,Lu W,Lakshmanan L V S.Celf++:optimizing the greedy algorithm for influence maximization in social networks[C]∥Proceedings of the 20th International Conference Companion on World Wide Web.ACM,2011:47-48 [5] Chen W,Yuan Y,Zhang L.Scalable influence maximization in social networks under the linear threshold model[C]∥2010 IEEE 10th International Conference on Data Mining (ICDM).IEEE,2010:88-97 [6] Anagnostopoulos A,Kumar R,Mahdian M.Influence and correlation in social networks[C]∥Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2008:7-15 [7] Tang J,Sun J,Wang C,et al.Social influence analysis in large-scale networks[C]∥Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mi-ning.ACM,2009:807-816 [8] Goyal A,Bonchi F,Lakshmanan L V S.Learning influence pro-babilities in social networks[C]∥Proceedings of the Third ACM International Conference on Web Search and Data Mi-ning.ACM,2010:241-250 [9] Xiang B,Liu Q,Chen E,et al.Pagerank with priors:An influence propagation perspective[C]∥Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence.AAAI Press,2013:2740-2746 [10] Goyal A,Lu W,Lakshmanan L V S.Celf++:optimizing the greedy algorithm for influence maximization in social networks[C]∥Proceedings of the 20th International Conference Companion on World Wide Web.ACM,2011:47-48 |
No related articles found! |
|