Maximizing positive influence in competitive social networks: a trust-based solution. (English) Zbl 1479.91285
This paper studies positive influence maximization in competitive social networks. A trust-based solution is proposed, which stresses on the trust relationship in online social networks. The model leverages on the competitive influence diffusion which models the dynamics of the influence spreads. Positive influence is modeled by trust and negative influence is modeled by distrust. To compute the influence probabilities in the trust-based competitive influence diffusion, the paper uses the generalized network flows methods. The paper also proposes a trust-based competitive influence maximization algorithm to derive the positive marginal gain for users who are not seeds. The results are tested on some realistic datasets and the experiments show good efficiency of the proposed method.
Reviewer: Yilun Shang (Newcastle)
MSC:
| 91D30 | Social networks; opinion dynamics |
Keywords:
influence maximization; trust evaluation; competitive influence diffusion; online social networksReferences:
| [1] | N. Arazkhani, M.R. Meybodi, A. Rezvanian, Influence blocking maximization in social network using centrality measures, in Proceedings of the 5th IEEE Conference on Knowledge Based Engineering and Innovation (KBEI 2019), Tehran, Iran, 2019, pp. 492-497. |
| [2] | Asim, Y.; Malik, A. K.; Raza, B.; Shahid, A. R., A trust model for analysis of trust, influence and their relationship in social network communities, Telematics and Informatics, 36, 94-116 (2019) |
| [3] | Basuchowdhuri, P.; Sikdar, S.; Nagarajan, V.; Gupta, S.; Majumder, S., Fast detection of community structures using graph traversal in social networks, Knowledge and Information Systems, 59, 1, 1-31 (2019) |
| [4] | R. Bian, Y. Koh, G. Dobbie, A. Divoli, Identifying top-k nodes in social networks: a survey, ACM Computing Surveys 52 (1) (2019) (Article No. 22). |
| [5] | M. Brede, M. Stella, A.C. Kalloniatis, Competitive influence maximization and enhancement of synchronization in populations of non-identical kuramoto oscillators, Scientific Reports 8 (1) (2018) (Article No. 702). |
| [6] | A. Calio, A. Tagarelli, Complex influence propagation based on trust-aware dynamic linear threshold models, Applied Network Science 4 (1) (2019) (Article No. 14). |
| [7] | He, J. S.; Kaur, H.; Talluri, M., Positive opinion influential node set selection for social networks: considering both positive and negative relationships, Wireless Communications, Networking and Applications, 935-948 (2016) |
| [8] | Hosseini-Pozveh, M.; Zamanifar, K.; Naghsh-Nilchi, A. R.; Dolog, P., Maximizing the spread of positive influence in signed social networks, Intelligent Data Analysis, 20, 1, 199-218 (2016) |
| [9] | Huang, C.; Jiang, W.; Wu, J.; Wang, G., Personalized review recommendation based on users’ aspect sentiment, ACM Transactions on Internet Technology (2020) |
| [10] | Huang, H.; Shen, H.; Meng, Z.; Chang, H.; He, H., Community-based influence maximization for viral marketing, Applied Intelligence, 49, 6, 2137-2150 (2019) |
| [11] | W. Jiang, G. Wang, M.A. Bhuiyan, J. Wu, Understanding graph-based trust evaluation in online social networks: methodologies and challenges, ACM Computing Surveys 49 (1) (2016) (Article 10). |
| [12] | Jiang, W.; Wu, J.; Li, F.; Wang, G.; Zheng, H., Trust evaluation in online social networks using generalized network flow, IEEE Transactions on Computers, 65, 3, 952-963 (2015) · Zbl 1360.68184 |
| [13] | Ju, W.; Chen, L.; Li, B.; Liu, W.; Sheng, J.; Wang, Y., A new algorithm for positive influence maximization in signed networks, Information Sciences, 512, 1571-1591 (2020) · Zbl 1456.91097 |
| [14] | D. Kempe, J. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2003), Washington, DC, USA, 2003, pp. 137-146. · Zbl 1337.91069 |
| [15] | J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, N. Glance, Cost-effective outbreak detection in networks, in: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2007), California, USA, 2007, pp. 420-429. |
| [16] | H. Li, S. Bhowmick, J. Cui, Y. Gao, J. Ma, GetReal: towards realistic selection of influence maximization strategies in competitive networks, in: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD 2015), Melbourne, Australia, 2015, pp. 1525-1537. |
| [17] | Lin, Y.; Lui, J. C., Analyzing competitive influence maximization problems with partial information: an approximation algorithmic framework, Performance Evaluation, 91, 187-204 (2015) |
| [18] | Q. Liu, B. Xiang, N.J. Yuan, E. Chen, H. Xiong, Y. Zheng, Y. Yang, An influence propagation view of PageRank, ACM Transactions on Knowledge Discovery from Data 11 (3) (2017) (Article No. 30). |
| [19] | Liu, W.; Yue, K.; Wu, H.; Li, J.; Liu, D.; Tang, D., Containment of competitive influence spread in social networks, Knowledge-Based Systems, 109, 266-275 (2016) |
| [20] | Ohara, K.; Saito, K.; Kimura, M.; Motoda, H., Resampling-based predictive simulation framework of stochastic diffusion model for identifying top-K influential nodes, International Journal of Data Science and Analytics, 9, 2, 175-195 (2020) |
| [21] | Peng, S.; Wang, G.; Xie, D., Social influence analysis in social networking big data: opportunities and challenges, IEEE Network, 33, 1, 11-17 (2017) |
| [22] | Peng, S.; Wang, G.; Zhou, Y.; Wan, C.; Wang, C.; Yu, S.; Niu, J., An immunization framework for social networks through big data based influence modeling, IEEE Transactions on Dependable and Secure Computing, 16, 6, 984-995 (2019) |
| [23] | Y. Peng, P. Lu, C. Chang, D.S. Lee, Percolation threshold for competitive influence in random networks, arXiv preprint arXiv:1904.05754, 2019. |
| [24] | L. Sun, A. Chen, P.S. Yu, W. Chen, Influence maximization with spontaneous user adoption, in: Proceedings of the 13th International Conference on Web Search and Data Mining (WSDM 2020), Texas, USA, 2020, pp. 573-581. |
| [25] | Wang, F.; Jiang, W.; Li, X.; Wang, G., Maximizing positive influence spread in online social networks via fluid dynamics, Future Generation Computer Systems, 86, 1491-1502 (2018) |
| [26] | Wang, F.; Jiang, W.; Wang, G.; Song, G., Influence maximization by leveraging the crowdsensing data in information diffusion network, Journal of Network and Computer Applications, 136, 11-21 (2019) |
| [27] | F. Wang, G. Wang, D. Xie, Maximizing the spread of positive influence under LT-MLA model, in: Proceedings of the 10th Asia-Pacific Services Computing Conference (APSCC 2016), Zhangjiajie, China, Springer International Publishing, 2016, pp. 450-463. |
| [28] | L. Wu, P. Sun, Y. Fu, R. Hong, X. Wang, M. Wang, A neural influence diffusion model for social recommendation, in: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2019), Paris, France, 2019, pp. 235-244. |
| [29] | Zareie, A.; Sheikhahmadi, A.; Jalili, M., Identification of influential users in social networks based on users’ interest, Information Sciences, 493, 217-231 (2019) · Zbl 1451.91158 |
| [30] | Zhang, B.; Zhang, L.; Mu, C.; Zhao, Q.; Song, Q.; Hong, X., A most influential node group discovery method for influence maximization in social networks: a trust-based perspective, Data and Knowledge Engineering, 121, 71-87 (2019) |
| [31] | H. Zhang, T.N. Dinh, M.T. Thai, Maximizing the spread of positive influence in online social networks, in: Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems (ICDCS 2013), Philadelphia, USA, 2013, pp. 317-326. |
| [32] | C. Zhou, P. Zhang, J. Guo, X. Zhu, L. Guo, UBLF: an upper bound based approach to discover influential nodes in social networks, in: Proceedings of the 13th IEEE International Conference on Data Mining (ICDM 2013), Texas, USA, 2013, pp. 907-916. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
