EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks

Lei Zhang, Yutong Liu, Haipeng Yang, Fan Cheng, Qi Liu, Xingyi Zhang

CAAI Transactions on Intelligence Technology · 2023-09 · 8 (3) · 893-913

DOI: 10.1049/cit2.12158 ↗

Kurz gefasst

Fachartikel in der Zeitschrift CAAI Transactions on Intelligence Technology, online erschienen am 23.01.2023. Verfasst von Lei Zhang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 21-mal zitiert (Crossref) und nennt 53 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0). Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Anhui Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Influence maximization, whose aim is to maximise the expected number of influenced nodes by selecting a seed set of k influential nodes from a social network, has many applications such as goods advertising and rumour suppression. Among the existing influence maximization methods, the community‐based ones can achieve a good balance between effectiveness and efficiency. However, this kind of algorithm usually utilise the network community structures by viewing each node as a non‐overlapping node. In fact, many nodes in social networks are overlapping ones, which play more important role in influence spreading. To this end, an overlapping community‐based particle swarm optimization algorithm named OCPSO for influence maximization in social networks, which can make full use of overlapping nodes, non‐overlapping nodes, and their interactive information is proposed. Specifically, an overlapping community detection algorithm is used to obtain the information of overlapping community structures, based on which three novel evolutionary strategies, such as initialisation, mutation, and local search are designed in OCPSO for better finding influential nodes. Experimental results in terms of influence spread and running time on nine real‐world social networks demonstrate that the proposed OCPSO is competitive and promising comparing to several state‐of‐the‐arts (e.g. CGA, CMA‐IM, CIM, CDH‐SHRINK, CNCG, and CFIN).

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Anhui Province

Zitieren

APA

Zhang, L., Liu, Y., Yang, H., Cheng, F., Liu, Q., & Zhang, X. (2023). Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks. CAAI Transactions on Intelligence Technology, 8(3), 893-913. https://doi.org/10.1049/cit2.12158

Vancouver

Zhang L, Liu Y, Yang H, Cheng F, Liu Q, Zhang X. Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks. CAAI Transactions on Intelligence Technology. 2023;8(3):893-913. doi:10.1049/cit2.12158

BibTeX
@article{Zhang2023,
  author = {Zhang, Lei and Liu, Yutong and Yang, Haipeng and Cheng, Fan and Liu, Qi and Zhang, Xingyi},
  title = {Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks},
  journal = {CAAI Transactions on Intelligence Technology},
  year = {2023},
  volume = {8},
  number = {3},
  pages = {893--913},
  doi = {10.1049/cit2.12158}
}
Kostenlos starten →