A Novel Influence Maximization Algorithm for a Competitive Environment Based on Social Media Data Analytics
influence maximization, competitive environment, dynamic network
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.
Tong, Jie; Shi, Leilei; Liu, Lu; Panneerselvam, John; and Han, Zixuan
"A Novel Influence Maximization Algorithm for a Competitive Environment Based on Social Media Data Analytics,"
Big Data Mining and Analytics: Vol. 5:
2, Article 5.
Available at: https://dc.tsinghuajournals.com/big-data-mining-and-analytics/vol5/iss2/5