AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Big Data Mining and Analytics Article
PDF (5.2 MB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

A Novel Influence Maximization Algorithm for a Competitive Environment Based on Social Media Data Analytics

School of Computer Science and Telecommunication Engineering and Jiangsu Key Laboratory of Security Technology for Industrial Cyberspace, Jiangsu University, Zhenjiang 212013, China
School of Computing and Mathematical Sciences, University of Leicester, Leicester LE1 7RH, UK
Show Author Information

Abstract

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.

Keywords

influence maximizationcompetitive environmentdynamic network

References

[1]
L. L. Shi, Y. Wu, L. Liu, X. Sun, and L. Jiang, Event detection and identification of influential spreaders in social media data streams, Big Data Mining and Analytics, vol. 1, no. 1, pp. 34-46, 2018.
Crossref Google Scholar
[2]
L. L. Shi, L. Liu, Y. Wu, L. Jiang, M. Kazim, H. Ali, and J. Panneerselvam, Human-centric cyber social computing model for hot-event detection and propagation, IEEE Trans. Comput. Soc. Syst., vol. 6, no. 5, pp. 1042-1050, 2019.
Crossref Google Scholar
[3]
H. Lu, S. X. Liu, H. Wei, and J. J. Tu, Multi-kernel fuzzy clustering based on auto-encoder for fMRI functional network, Expert Syst. Appl., vol. 159, p. 113513, 2020.
Crossref Google Scholar
[4]
A. Monney, Y. Z. Zhan, Z. Jiang, and B. B. Benuwa, A multi-kernel method of measuring adaptive similarity for spectral clustering, Expert Syst. Appl., vol. 159, p. 113570, 2020.
Crossref Google Scholar
[5]
S. N. Tang, S. Q. Yuan, and Y. Zhu, Data preprocessing techniques in convolutional neural network based on fault diagnosis towards rotating machinery, IEEE Access, vol. 8, pp. 149487-149496, 2020.
Crossref Google Scholar
[6]
L. L. Shi, L. Liu, Y. Wu, L. Jiang, J. Panneerselvam, and R. Crole, A social sensing model for event detection and user influence discovering in social media data streams, IEEE Trans. Comput. Soc. Syst., vol. 7, no. 1, pp. 141-150, 2020.
Crossref Google Scholar
[7]
G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol. 435, no. 7043, pp. 814-818, 2005.
Crossref Google Scholar
[8]
S. Gregory, Finding overlapping communities in networks by label propagation, New J. Phys., vol. 12, p. 103018, 2010.
Crossref Google Scholar
[9]
S. Y. Shih, M. Lee, and C. C. Chen, An effective friend recommendation method using learning to rank and social influence, in Proc. PACIS 2015, Singapore, 2015, pp. 242-250.
Google Scholar
[10]
P. Kim and S. Kim, Detecting overlapping and hierarchical communities in complex network using interaction-based edge clustering, Phys. A Stat. Mech. Appl., vol. 417, pp. 46-56, 2015.
Crossref Google Scholar
[11]
J. Ge, L. L. Shi, Y. Wu, and J. Liu, Human-driven dynamic community influence maximization in social media data streams, IEEE Access, vol. 8, pp. 162238-162251, 2020.
Crossref Google Scholar
[12]
P. Domingos and M. Richardson, Mining the network value of customers, in Proc. 7th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 2001, pp. 57-66.
Crossref Google Scholar
[13]
D. Kempe, J. Kleinberg, and É. Tardos, Maximizing the spread of influence through a social network, in Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Washington, DC, USA, 2003, pp. 137-146.
Crossref Google Scholar
[14]
C. Wang, W. Chen, and Y. J. Wang, Scalable influence maximization for independent cascade model in large-scale social networks, Data Min. Knowl. Discov., vol. 25, no. 3, pp. 545-576, 2012.
Crossref Google Scholar
[15]
J. T. Tian, Y. T. Wang, X. J. Feng, A new hybrid algorithm for influence maximization in social networks, (in Chinese), Chin. J. Comput., vol. 10, no. 3, pp. 1956-1965, 2011.
Crossref Google Scholar
[16]
A. Beutel, B. A. Prakash, R. Rosenfeld, and C. Faloutsos, Interacting viruses in networks: Can both survive? in Proc. 18th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Beijing, China, 2012, pp. 426-434.
Crossref Google Scholar
[17]
J. M. Chen, L. L. Shi, L. Liu, A. O. Ayorinde, R. B. Zhu, and J. Panneerselvam, User interest communities influence maximization in a competitive environment, in Proc. 2020 16th Int. Conf. on Mobility, Sensing and Networking, Tokyo, Japan, 2020, pp. 614-621.
Crossref Google Scholar
[18]
S. Bharathi, D. Kempe, and M. Salek, Competitive influence maximization in social networks, in Proc. 3rd Int. Workshop on Web and Internet Economics, Berlin, Germany, 2007, pp. 306-311.
Crossref Google Scholar
[19]
A. Bozorgi, S. Samet, J. Kwisthout, and T. Wareham, Community-based influence maximization in social networks under a competitive linear threshold model, Knowl. Based Syst., vol. 134, pp. 149-158, 2017.
Crossref Google Scholar
[20]
B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J., vol. 49, no. 2, pp. 291-307, 2014.
Crossref Google Scholar
[21]
Y. C. Wei and C. K. Cheng, Ratio cut partitioning for hierarchical designs, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., vol. 10, pp. 911-921, 1991.
Crossref Google Scholar
[22]
L. Jiang, L. L. Shi, L. Liu, J. J. Yao, B. Yuan, and Y. J. Zheng, An efficient evolutionary user interest community discovery model in dynamic social networks for internet of people, IEEE Internet Things J., vol. 6, no. 6, pp. 9226-9236, 2019.
Crossref Google Scholar
[23]
S. C. Liu, F. X. Zhu, and L. Gan, A label-propagation-probability-based algorithm for overlapping community detection, (in Chinese), Chin. J. Comput., vol. 39, no. 4, pp. 717-729, 2016.
Google Scholar
[24]
Y. Zhu, D. Li, and Z. Zhang, Minimum cost seed set for competitive social influence, in Proc. of IEEE International Conference on Computer Communications, San Francisco, CA, USA, .
Crossref Google Scholar
[25]
B. Ribeiro and C. Faloutsos, Modeling website popularity competition in the attention-activity marketplace, in Proc. 8th ACM Int. Conf. on Web Search and Data Mining, Shanghai, China, 2015, pp. 389-398.
Crossref Google Scholar
[26]
A. Beutel, B. A. Prakash, R. Rosenfeld, and C. Faloutsos, Interacting viruses in networks: Can both survive? in Proc. 18th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, Beijing, China, 2012, pp. 426-434.
Crossref Google Scholar
[27]
C. W. Tsai, Y. C. Yang, and M. C. Chiang, A genetic NewGreedy algorithm for influence maximization in social network, in Proc. 2015 IEEE Int. Conf. on Systems, Man, and Cybernetics, Hong Kong, China, 2016, pp. 2549-2554.
Crossref Google Scholar
[28]
L. L. Shi, L. Liu, Y. Wu, L. Jiang, and J. Hardy, Event detection and user interest discovering in social media data streams, IEEE Access, vol. 5, pp. 20953-20964, 2017.
Crossref Google Scholar
[29]
D. M. Blei, A. Y. Ng, and M. I. Jordan, Latent dirichlet allocation, J. Mach. Learn. Res., vol. 3, pp. 993-1022, 2003.
Google Scholar
[30]
N. Trivedi and A. Singh, Efficient influence maximization in social-networks under independent cascade model, Proced. Comput. Sci., vol. 173, pp. 315-324, 2020.
Crossref Google Scholar
[31]
A. N. Langville and C. D. J. T. M. I. Meyer, Google’s pagerank and beyond, The Science of Search Engine Rankings, vol. 30, no. 1, pp. 68-69, 2011.
Crossref Google Scholar
Big Data Mining and Analytics
Volume 5 Issue 2,
June 2022
Pages 130-139
DOI: 10.26599/BDMA.2021.9020024
Cite this article:
Tong J, Shi L, Liu L, et al. A Novel Influence Maximization Algorithm for a Competitive Environment Based on Social Media Data Analytics. Big Data Mining and Analytics, 2022, 5(2): 130-139. https://doi.org/10.26599/BDMA.2021.9020024

1634

Views

939

Downloads

17

Crossref

11

Web of Science

19

Scopus

0

CSCD

Altmetrics
Received: 01 November 2021
Accepted: 12 November 2021
Published: 25 January 2022
© The author(s) 2022.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).
Return