EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Hypergraph-Based Influence Maximization in Online Social Networks

Chuangchuang Zhang, Wenlin Cheng, Fuliang Li, Xingwei Wang

Mathematics · 07.09.2024 · 12 (17) · 2769

DOI: 10.3390/math12172769 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 07.09.2024. Verfasst von Chuangchuang Zhang und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Natural Science Foundation of Shandong Province of China, National Key Research and Development Program of China, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Influence maximization in online social networks is used to select a set of influential seed nodes to maximize the influence spread under a given diffusion model. However, most existing proposals have huge computational costs and only consider the dyadic influence relationship between two nodes, ignoring the higher-order influence relationships among multiple nodes. It limits the applicability and accuracy of existing influence diffusion models in real complex online social networks. To this end, in this paper, we present a novel information diffusion model by introducing hypergraph theory to determine the most influential nodes by jointly considering adjacent influence and higher-order influence relationships to improve diffusion efficiency. We mathematically formulate the influence maximization problem under higher-order influence relationships in online social networks. We further propose a hypergraph sampling greedy algorithm (HSGA) to effectively select the most influential seed nodes. In the HSGA, a random walk-based influence diffusion method and a Monte Carlo-based influence approximation method are devised to achieve fast approximation and calculation of node influences. We conduct simulation experiments on six real datasets for performance evaluations. Simulation results demonstrate the effectiveness and efficiency of the HSGA, and the HSGA has a lower computational cost and higher seed selection accuracy than comparison mechanisms.

Förderung

  • Natural Science Foundation of Shandong Province of China
  • National Key Research and Development Program of China
  • National Natural Science Foundation of China

Zitieren

APA

Zhang, C., Cheng, W., Li, F., & Wang, X. (2024). Hypergraph-Based Influence Maximization in Online Social Networks. Mathematics, 12(17), 2769. https://doi.org/10.3390/math12172769

Vancouver

Zhang C, Cheng W, Li F, Wang X. Hypergraph-Based Influence Maximization in Online Social Networks. Mathematics. 2024;12(17):2769. doi:10.3390/math12172769

BibTeX
@article{Zhang2024,
  author = {Zhang, Chuangchuang and Cheng, Wenlin and Li, Fuliang and Wang, Xingwei},
  title = {Hypergraph-Based Influence Maximization in Online Social Networks},
  journal = {Mathematics},
  year = {2024},
  volume = {12},
  number = {17},
  pages = {2769},
  doi = {10.3390/math12172769}
}
Kostenlos starten →