Top

International Journal of Machine Learning and Cybernetics

Published in:

09-08-2023 | Original Article

Stemming competitive influence spread in social networks through binary ions motion optimization

Authors: Ping Kong, Chao Wang, Liangliang Ma, Ye Ye, Lu Wang, Nenggang Xie

Published in: International Journal of Machine Learning and Cybernetics | Issue 2/2024

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

The rapid development of social networks has brought many conveniences, but it has also resulted in the wanton dissemination of negative information. Identifying key users in the network to block negative information in a timely and effective manner has become an urgent research task. For this purpose, this paper proposes a binary ions motion optimization algorithm to maximize the blocking of negative influence propagation under a competitive-based model. The algorithm adopts a degree-based heuristic initialization strategy by recoding search agents and blocking diffusion channels based on the negative seed location. To overcome the lack of crystal phase search ability, a crossover mechanism of anions and cations is introduced, which accelerates convergence and facilitates the discovery of optimal solution. Finally, the effectiveness of the proposed algorithm is demonstrated on real networks and synthetic networks, showing significant advancements compared to other algorithms.

previous article Adaptive weighting function for weighted nuclear norm based matrix/tensor completion

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

ATZelectronics worldwide

ATZlectronics worldwide is up-to-speed on new trends and developments in automotive electronics on a scientific level with a high depth of information.

Order your 30-days-trial for free and without any commitment.

inform now

ATZelektronik

Die Fachzeitschrift ATZelektronik bietet für Entwickler und Entscheider in der Automobil- und Zulieferindustrie qualitativ hochwertige und fundierte Informationen aus dem gesamten Spektrum der Pkw- und Nutzfahrzeug-Elektronik.

Lassen Sie sich jetzt unverbindlich 2 kostenlose Ausgabe zusenden.

inform now

Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137–146 (2003). https://doi.org/10.1145/956750.956769

Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420–429. https://doi.org/10.1145/1281192.1281239

Brin S, Page L (2012) Reprint of: The anatomy of a large-scale hypertextual web search engine. Comput Netw 56(18):3825–3833. https://doi.org/10.1016/j.comnet.2012.10.007CrossRef

Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. SIAM, pp 946–957. https://doi.org/10.1137/1.9781611973402.70

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. https://doi.org/10.1145/1963192.1963217

Gao G, Xiao M, Wu J, Huang H, Chen G (2018) Minimum cost seed selection for multiple influences diffusion in communities. In: 2018 IEEE 15th international conference on mobile ad hoc and sensor systems (MASS). IEEE, pp 263–271. https://doi.org/10.1137/1.9781611973402.70

Liu Z, Li Y, Liu H (2021) Influence maximization based on maximum inner product search. Neural Comput Appl. https://doi.org/10.1007/s00521-021-06595-2CrossRef

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. https://doi.org/10.1016/j.ins.2016.07.012CrossRef

Şimşek A, Resul K (2018) Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks. Expert Syst Appl 114:224–236. https://doi.org/10.1016/j.eswa.2018.07.038CrossRef

10.

Wang L, Ma L, Wang C, Xie N, Koh JM, Cheong KH (2021) Identifying influential spreaders in social networks through discrete moth-flame optimization. IEEE Trans Evol Comput 25(6):1091–1102. https://doi.org/10.1109/TEVC.2021.3081478CrossRef

11.

Bozorgi A, Haghighi H, Zahedi MS, Rezvani M (2016) Incim: a community-based algorithm for influence maximization problem under the linear threshold model. Inf Process Manag 52(6):1188–1199. https://doi.org/10.1016/j.ipm.2016.05.006CrossRef

12.

Martinez-Seis B, Li X, Wang X (2019) Measure community quality by attribute importance and density in social networks. In: 2019 IEEE 15th international conference on automation science and engineering (CASE). IEEE, pp 628–633. https://doi.org/10.1109/COASE.2019.8842970

13.

Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE international conference on data mining. IEEE, pp 88–97. https://doi.org/10.1109/icdm.2010.118

14.

Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: International workshop on web and internet economics. Springer, pp 306–311. https://doi.org/10.1007/978-3-540-77105-0_31

15.

Bor SE (2014) Using social network sites to improve communication between political campaigns and citizens in the 2012 election. Am Behav Sci 58(9):1195–1213. https://doi.org/10.1177/0002764213490698CrossRef

16.

Huang H, Chen Y, Ma Y (2021) Modeling the competitive diffusions of rumor and knowledge and the impacts on epidemic spreading. Appl Math Comput 388:125536. https://doi.org/10.1016/j.amc.2020.125536MathSciNetCrossRef

17.

Yang L, Li Z, Giua A (2020) Containment of rumor spread in complex social networks. Inf Sci 506:113–130. https://doi.org/10.1016/j.ins.2019.07.055MathSciNetCrossRef

18.

Kimura M, Saito K, Motoda H (2009) Blocking links to minimize contamination spread in a social network. ACM Trans Knowl Discov Data (TKDD) 3(2):1–23. https://doi.org/10.1145/1514888.1514892CrossRef

19.

Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: International workshop on internet and network economics. Springer, pp 539–550. https://doi.org/10.1007/978-3-642-17572-5_48

20.

He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 Siam international conference on data mining. SIAM, pp 463–474. https://doi.org/10.1137/1.9781611972825.40

21.

Bozorgi A, Samet S, Kwisthout J, Wareham T (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl Based Syst 134:149–158. https://doi.org/10.1016/j.knosys.2017.07.029CrossRef

22.

Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33–57. https://doi.org/10.1007/s11721-007-0002-0CrossRef

23.

Wang C, Xu R-Q, Ma L, Zhao J, Wang L, Xie N-G, Cheong KH (2023) An efficient salp swarm algorithm based on scale-free informed followers with self-adaption weight. Appl Intell 53(2):1759–1791. https://doi.org/10.1007/s10489-022-03438-yCrossRef

24.

Pourpanah F, Wang R, Lim CP, Wang X, Yazdani D (2023) A review of artificial fish swarm algorithms: recent advances and applications. Artif Intell Rev 56(3):1867–1903. https://doi.org/10.1007/s10462-022-10214-4CrossRef

25.

Javidy B, Hatamlou A, Mirjalili S (2015) Ions motion algorithm for solving optimization problems. Appl Soft Comput 32:72–79. https://doi.org/10.1016/j.asoc.2015.03.035CrossRef

26.

Issa M, Abd Elaziz M (2020) Analyzing Covid-19 virus based on enhanced fragmented biological local aligner using improved ions motion optimization algorithm. Appl Soft Comput 96:106683. https://doi.org/10.1016/j.asoc.2020.106683CrossRef

27.

Das S, Bhattacharya A, Chakraborty AK (2018) Quasi-reflected ions motion optimization algorithm for short-term hydrothermal scheduling. Neural Comput Appl 29(6):123–149. https://doi.org/10.1007/s00521-016-2529-8CrossRef

28.

Pan J-S, Nguyen T-T, Chu S-C, Dao T-K, Ngo T-G (2018) A multi-objective ions motion optimization for robot path planning. In: International conference on engineering research and applications. Springer, pp 46–54. https://doi.org/10.1007/978-3-030-04792-4_8

29.

Nguyen T, Wang M, Pan J, Dao T, Ngo T (2020) A load economic dispatch based on ion motion optimization algorithm. In: Advances in intelligent information hiding and multimedia signal processing. Springer, pp 115–125. https://doi.org/10.1007/978-981-13-9710-3_12

30.

Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, pp 57–66. https://doi.org/10.1145/502512.502525

31.

Li W, Fan Y, Mo J, Liu W, Wang C, Xin M, Jin Q (2020) Three-hop velocity attenuation propagation model for influence maximization in social networks. World Wide Web 23(2):1261–1273. https://doi.org/10.1007/s11280-019-00750-5CrossRef

32.

He Y, Xie H, Wong T-L, Wang X (2018) A novel binary artificial bee colony algorithm for the set-union knapsack problem. Future Gener Comput Syst 78:77–86. https://doi.org/10.1016/j.future.2017.05.044CrossRef

33.

He Y, Wang X (2021) Group theory-based optimization algorithm for solving knapsack problems. Knowl Based Syst 219:104445. https://doi.org/10.1016/j.knosys.2018.07.045CrossRef

34.

Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International conference on systems, man, and cybernetics. Computational cybernetics and simulation, vol 5. IEEE, pp 4104–4108. https://doi.org/10.1109/icsmc.1997.637339

35.

Rashedi E, Nezamabadi-Pour H, Saryazdi S (2010) Bgsa: binary gravitational search algorithm. Nat Comput 9(3):727–745. https://doi.org/10.1007/s11047-009-9175-3MathSciNetCrossRef

36.

Faris H, Mafarja MM, Heidari AA, Aljarah I, Ala’m A-Z, Mirjalili S, Fujita H (2018) An efficient binary salp swarm algorithm with crossover scheme for feature selection problems. Knowl Based Syst 154:43–67. https://doi.org/10.1016/j.knosys.2018.05.009CrossRef

37.

Emary E, Zawbaa HM, Hassanien AE (2016) Binary ant lion approaches for feature selection. Neurocomputing 213:54–65. https://doi.org/10.1016/j.neucom.2016.03.101CrossRef

38.

Zhou Y, Kang J, Kwong S, Wang X, Zhang Q (2021) An evolutionary multi-objective optimization framework of discretization-based feature selection for classification. Swarm Evol Comput 60:100770. https://doi.org/10.1016/j.swevo.2020.100770CrossRef

39.

Frank A, Asuncion A, et al (2010) Uci machine learning repository. http://archive.ics.uci.edu

40.

Guo G, Wang H, Bell D, Bi Y, Greer K (2003) Knn model-based approach in classification. In: On the move to meaningful internet systems 2003: CoopIS, DOA, and ODBASE: OTM confederated international conferences, CoopIS, DOA, and ODBASE 2003, Catania, Sicily, Italy, November 3–7, 2003. Proceedings. Springer, pp 986–996. https://doi.org/10.1007/978-3-540-39964-3_62

41.

Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82. https://doi.org/10.1109/4235.585893CrossRef

42.

Rossi R, Ahmed N (2015) The network data repository with interactive graph analytics and visualization. In: Twenty-ninth AAAI conference on artificial intelligence, pp 4292–4293. https://doi.org/10.1609/aaai.v29i1.9277

43.

Rossi R, Ahmed N (2012) Network repository: a scientific network data repository with interactive visualization and mining tools. https://networkrepository.com

44.

Rossi RA, Ahmed NK (2015) Networkrepository: A graph data repository with visual interactive analytics. In: 29th AAAI conference on artificial intelligence, Austin, Texas, USA, pp 25–30. arXiv:1410.3560

45.

Kunegis J (2013) Konect: the koblenz network collection. In: Proceedings of the 22nd international conference on World Wide Web, pp 1343–1350. http://dx.doi.org/10.1145/2487788.2488173

46.

Watts DJ, Strogatz SH (1998) Collective dynamics of ‘small-world’ networks. Nature 393(6684):440–442. https://doi.org/10.1038/30918CrossRef

47.

Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72(2):027104. https://doi.org/10.1103/physreve.72.027104CrossRef

48.

Erdős P, Rényi A et al (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5(1):17–60MathSciNet

49.

Arazkhani N, Meybodi MR, Rezvanian A (2019) Influence blocking maximization in social network using centrality measures. In: 2019 5th conference on knowledge based engineering and innovation (KBEI). IEEE, pp 492–497. https://doi.org/10.1109/KBEI.2019.8734920

Title: Stemming competitive influence spread in social networks through binary ions motion optimization
Authors: Ping Kong
Chao Wang
Liangliang Ma
Ye Ye
Lu Wang
Nenggang Xie
Publication date: 09-08-2023
Publisher: Springer Berlin Heidelberg
Published in: International Journal of Machine Learning and Cybernetics / Issue 2/2024
Print ISSN: 1868-8071
Electronic ISSN: 1868-808X
DOI: https://doi.org/10.1007/s13042-023-01936-0

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

ATZelectronics worldwide

ATZelektronik

Other articles of this Issue 2/2024

Entropy regularized fuzzy nonnegative matrix factorization for data clustering

Multiple-model and time-sensitive dynamic active learning for recurrent graph convolutional network model extraction attacks

MetaCL: a semi-supervised meta learning architecture via contrastive learning

Gaussian mixture model with local consistency: a hierarchical minimum message length-based approach

Federated domain generalization for intelligent fault diagnosis based on pseudo-siamese network and robust global model aggregation

Three-way conflict analysis with similarity degree on an issue set