期刊文献+

A Novel Influence Maximization Algorithm for a Competitive Environment Based on Social Media Data Analytics 被引量:2

原文传递
导出
摘要 Online social networks are increasingly connecting people around the world.Influence maximization is a key area of research in online social networks,which identifies influential users during information dissemination.Most of the existing influence maximization methods only consider the transmission of a single channel,but real-world networks mostly include multiple channels of information transmission with competitive relationships.The problem of influence maximization in an environment involves selecting the seed node set for certain competitive information,so that it can avoid the influence of other information,and ultimately affect the largest set of nodes in the network.In this paper,the influence calculation of nodes is achieved according to the local community discovery algorithm,which is based on community dispersion and the characteristics of dynamic community structure.Furthermore,considering two various competitive information dissemination cases as an example,a solution is designed for self-interested information based on the assumption that the seed node set of competitive information is known,and a novel influence maximization algorithm of node avoidance based on user interest is proposed.Experiments conducted based on real-world Twitter dataset demonstrates the efficiency of our proposed algorithm in terms of accuracy and time against notable influence maximization algorithms.
出处 《Big Data Mining and Analytics》 EI 2022年第2期130-139,共10页 大数据挖掘与分析(英文)
基金 supported by the National Natural Science Foundation of China(Nos.61502209 and 61502207)
  • 相关文献

参考文献2

二级参考文献15

  • 1赵卓翔,王轶彤,田家堂,周泽学.社会网络中基于标签传播的社区发现新算法[J].计算机研究与发展,2011,48(S3):8-15. 被引量:37
  • 2Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence in a social network//Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Washington, USA, 2003: 137-146.
  • 3Chen Wei, Wang Ya Jun, Yang Si Yu. Efficient influence maximization in social networks//Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Dis covery and Data Mining. Paris, France, 2009:199 208.
  • 4Young H P. The diffusion of innovations in social net works//Blume L, Durlauf S. The Economy as a Complex System III. USA: Oxford University Press, 2003:1-19.
  • 5Watts D J. A simple model of global cascades on random net works. National Academy of Sciences, 2002, 99(9): 5766- 5571.
  • 6Goldenberg J, Libai B, Muller E. Talk of the network: A complex systems look at the underlying process of word-of- mouth. Marketing Letters, 2001, 12(3): 211-223.
  • 7Estevez Pablo A, Vera Pablo, Saito Kazumi. Selecting the most influential nodes in social networks//Proceedings of the International Joint Conference on Neural Networks. Orlando, Florida, USA, 2007:2397-2402.
  • 8Suri N Rama, Narahari Y. Determining the top k nodes in social networks using the shapely value (Short Paper)//Proceedings of the 7th International Joint Con{erence on Autono mous Agents and Multiagent Systems. Estoril, Portugal, 2008:1509-1512.
  • 9Wang YiTong, Feng XiaoJun. A potential-based node selection strategy for influence maximization in a social network//Proceedings of the 5th International Conference on Advanced Data Mining and Applications. Bering, China, 2009: 350-361.
  • 10Leskovec J, Huttenlocher D, Kleinberg J. Signed networks in social media//Proceedings of the 28th International Conference on Human Factors in Computing Systems. Atlanta, USA, 2010: 1361 -1370.

共引文献101

同被引文献8

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部