EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

PDNS-DODE: a discrete osprey optimization and differential evolution algorithm with PageRank diffusion neighborhood search for influence maximization in social networks

Yu Zhang, Huan Li, Xinyue Mo, Xianhong Zeng, Xiaoyu Na

PeerJ Computer Science · 19.03.2026 · 12 · e3730

DOI: 10.7717/peerj-cs.3730 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 19.03.2026. Verfasst von Yu Zhang und 4 weiteren Autor:innen. Die Arbeit nennt 57 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Hainan Provincial Natural Science Foundation of China, Scientific Research Fund of Hainan University, Lanzhou University-Hainan University Technical Service Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Online social networks have become crucial platforms for marketing, leveraging their vast user bases and capacity for rapid information dissemination. Influence maximization (IM) problem plays a central role in applications such as viral marketing and information propagation. Nevertheless, IM remains challenging due to the difficulty in balancing accuracy and efficiency with existing methods. To overcome these limitations, a discrete hybrid optimizer called PDNS-DODE (PageRank-based Diffusion Neighborhood Search and Discrete Osprey Optimization with Differential Evolution) was proposed. The algorithm incorporates an adaptive three-hop diffusion neighborhood search (PDNS) strategy based on PageRank centrality, which dynamically adjusts the search scope to enable broader global exploration and targeted local optimization. A PageRank-descending initialization strategy is introduced to improve population diversity. Furthermore, the Osprey Optimization Algorithm (OOA) and Differential Evolution (DE) are discretized with revised individual representation and update mechanisms for solving the influence maximization problem. Extensive experiments on seven real-world networks under both Independent Cascade and Linear Threshold models demonstrate the robustness and superiority of PDNS-DODE. It consistently outperforms seven state-of-the-art baselines, achieving statistically significant improvements (Wilcoxon test) and the highest overall ranking (Friedman test). These advancements are attained while maintaining competitive computational efficiency.

Förderung

  • Hainan Provincial Natural Science Foundation of China
  • Scientific Research Fund of Hainan University
  • Lanzhou University-Hainan University Technical Service Project

Zitieren

APA

Zhang, Y., Li, H., Mo, X., Zeng, X., & Na, X. (2026). PDNS-DODE: a discrete osprey optimization and differential evolution algorithm with PageRank diffusion neighborhood search for influence maximization in social networks. PeerJ Computer Science, 12, e3730. https://doi.org/10.7717/peerj-cs.3730

Vancouver

Zhang Y, Li H, Mo X, Zeng X, Na X. PDNS-DODE: a discrete osprey optimization and differential evolution algorithm with PageRank diffusion neighborhood search for influence maximization in social networks. PeerJ Computer Science. 2026;12:e3730. doi:10.7717/peerj-cs.3730

BibTeX
@article{Zhang2026,
  author = {Zhang, Yu and Li, Huan and Mo, Xinyue and Zeng, Xianhong and Na, Xiaoyu},
  title = {PDNS-DODE: a discrete osprey optimization and differential evolution algorithm with PageRank diffusion neighborhood search for influence maximization in social networks},
  journal = {PeerJ Computer Science},
  year = {2026},
  volume = {12},
  pages = {e3730},
  doi = {10.7717/peerj-cs.3730}
}
Kostenlos starten →