Abstract
A consumer review network (CRN) is a social network among the members of a consumer review website where the relationships are formed based on the mutual ratings of the existing reviews of the participating members. The relationship is positive (negative) i.e. trust-based (distrust-based) when most of the reviews are given high (low) ratings. In a CRN, the consumers may not be interested in all product categories. The influence maximization in such a network demands seed set selection in such a way that the number of influenced consumers (with interest in the advertised product category) will be maximum. Formally, this is referred to as the targeted influence maximization (TIM) problem. Moreover, as the CRN is treated as a signed social network, the polarity of the social relationships impacts the influence propagation. As per the present state of the art, none of the existing solutions for TIM have considered the network as a signed one and are thus not suitable for CRN. In this paper, a metaheuristic discrete genetic-learning-enabled particle swarm optimization algorithm combined with a trustworthiness-heuristic-based local search strategy has been proposed for targeted positive influence maximization in CRNs. The existing spread estimation function has been replaced by a computationally efficient positive influence spread estimation function. The experiment has been conducted on two real-life CRNs and compared with the existing notable algorithm for necessary validation of the proposed solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aslay C, Barbieri N, Bonchi F, Baeza-Yates R (2014) Online topic-aware influence maximization queries. In: EDBT, pp. 295–306
Barbieri N, Bonchi F, Manco G (2013) Topic-aware social influence propagation models. Knowl Inf Syst 37(3):555–584
Chen S, Fan J, Li G, Feng J, Kl Tan, Tang J (2015) Online topic-aware influence maximization. Proc VLDB Endow 8(6):666–677
Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 57–66
Gong M, Yan J, Shen B, Ma L, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367:600–614
Gong YJ, Li JJ, Zhou Y, Li Y, Chung HSH, Shi YH, Zhang J (2015) Genetic learning particle swarm optimization. IEEE Trans Cybern 46(10):2277–2290
Goyal A, Lu W, Lakshmanan LV (2011) Celf++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on World wide web, pp. 47–48
Hosseini-Pozveh M, Zamanifar K, Naghsh-Nilchi AR, Dolog P (2016) Maximizing the spread of positive influence in signed social networks. Intell Data Anal 20(1):199–218
Jung K, Heo W, Chen W (2012) Irie: Scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining. IEEE, pp. 918–923
Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 137–146
Kundu G, Choudhury S (2021) Discrete genetic learning enabled PSO for influence maximization. Accepted in: 8th international doctoral symposium on applied computation and security systems. Springer
Li D, Wang C, Zhang S, Zhou G, Chu D, Wu C (2017) Positive influence maximization in signed social networks based on simulated annealing. Neurocomputing 260:69–78
Li D, Xu ZM, Chakraborty N, Gupta A, Sycara K, Li S (2014) Polarity related influence maximization in signed social networks. PloS one 9(7):e102199
Li Y, Chen W, Wang Y, Zhang ZL (2013) Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In: Proceedings of the 6th ACM international conference on Web search and data mining, pp. 657–666
Li Y, Zhang D, Tan KL (2015) Real-time targeted influence maximization for online advertisements
Liu W, Chen X, Jeon B, Chen L, Chen B (2019) Influence maximization on signed networks under independent cascade model. Appl Intell 49(3):912–928
Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 international conference on management of data, pp. 695–710
Nguyen HT, Thai MT, Dinh TN (2017) A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE/ACM Trans Netw 25(4):2419–2429
Sheng J, Chen L, Chen Y, Li B, Liu W (2020) Positive influence maximization in signed social networks under independent cascade model. Soft Comput 24(19):14287–14303
Tang J, Gao H, Liu H (2012) mTrust: discerning multi-faceted trust in a connected world. In: Proceedings of the 5th ACM international conference on web search and data mining. ACM, pp. 93–102
Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, pp. 1539–1554
Wang L, Yu Z, Xiong F, Yang D, Pan S, Yan Z (2019) Influence spread in geo-social networks: a multiobjective optimization perspective. IEEE Transactions on Cybernetics
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kundu, G., Choudhury, S. A discrete genetic learning enabled PSO for targeted positive influence maximization in consumer review networks. Innovations Syst Softw Eng 17, 247–259 (2021). https://doi.org/10.1007/s11334-021-00396-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11334-021-00396-5