EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

PDCSA: A parallel discrete crow search algorithm for influence maximization in social networks

Lihong Han iD, Kan Yang, Yang Ming, Jianxin Tang

PLOS One · 2025

DOI: 10.1371/journal.pone.0329350 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS One, 2025. Verfasst von Lihong Han und 3 weiteren Autor:innen. Beteiligte Einrichtung: School of Statistics and Data Science, Lanzhou University of Finance and Economics, Lanzhou, China. Hauptthemen laut MEDLINE: Algorithms, Social Networking. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Science and Technology Program of Gansu Province, Science Fund for Distinguished Young Scholars of Gansu Province, National Social Science Fund of China.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The essence of the influence maximization (IM) problem is how to identify the set of seed nodes so that the node numbers ultimately affected in the network reach the maximum under a certain spreading model. In the field of influence maximization research, the investigation of seed nodes identifying algorithms is a hot yet challenging work. Although conventional greedy algorithms and heuristic algorithms have high performance, their efficiency remains a challenge when applied to large-scale social networks. In recent years, swarm intelligence-based optimization algorithms have seen increasing application in addressing this problem, with notable improvements in performance. However, the efficiency of these swarm intelligence-based algorithms still needs to be improved in large-scale social networks. Based on this issue, a parallel discrete crow search algorithm (PDCSA) designed for parallel computing is proposed. Based on the evolution characteristics, PDCSA makes full use of the efficiency advantage of parallel computing to improve the time efficiency of solving IM problems.The results of experiments conducted on six datasets show that PDCSA achieves performance comparable to state-of-the-art algorithms, with the added advantages of high efficiency and robustness.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsSocial NetworkingHumansModels, Theoretical

Autor:innen und Institutionen

  • School of Statistics and Data Science, Lanzhou University of Finance and Economics, Lanzhou, China.
  • Key Laboratory of Digital Economy and Social Computing Science, Gansu Province, Lanzhou, China.
  • School of Computer and Communication, Lanzhou University of Technology, Lanzhou, China.

ORCID-Profile: Lihong Han

Förderung

  • Science and Technology Program of Gansu Province
  • Science Fund for Distinguished Young Scholars of Gansu Province
  • National Social Science Fund of China
  • Financial Statistics Research Integration Team of Lanzhou University of Finance and Economics

Zitieren

APA

Han, L., Yang, K., Ming, Y., & Tang, J. (2025). PDCSA: A parallel discrete crow search algorithm for influence maximization in social networks. PLOS One. https://doi.org/10.1371/journal.pone.0329350

Vancouver

Han L, Yang K, Ming Y, Tang J. PDCSA: A parallel discrete crow search algorithm for influence maximization in social networks. PLOS One. 2025. doi:10.1371/journal.pone.0329350

BibTeX
@article{Han2025,
  author = {Han, Lihong and Yang, Kan and Ming, Yang and Tang, Jianxin},
  title = {PDCSA: A parallel discrete crow search algorithm for influence maximization in social networks},
  journal = {PLOS One},
  year = {2025},
  doi = {10.1371/journal.pone.0329350}
}
Kostenlos starten →