The influence maximization algorithm for integrating attribute graph clustering and heterogeneous graph transformer

In social networks, maximizing influence is an important research direction. However, traditional influence maximization algorithms often overlook the attribute information of nodes and the heterogeneity of networks, leading to inefficiency and inaccuracy in the propagation process. To address this issue, this study first constructs a social network influence maximization propagation model, and then combines auto-encoder and graph convolutional autoencoder to extract social network user attributes. Finally, Transformer is used to learn the feature representation of social network nodes. Moreover, a heterogeneous graph neural network is introduced to combine with Transformer to further learn the feature representation of nodes, so as to design an influence maximization algorithm combining attributed graph clustering and heterogeneous graph Transformer. The results showed that the loss values of the fusion algorithm on different datasets were 0.619 and 0.17, respectively, proving its good fitting performance. The recall rate and F1 of this fusion algorithm were 92.5 % and 0.90, respectively, proving its high clustering accuracy. The influence maximization model based on fusion algorithm achieved active node coverage of 67 % and 48 % on two datasets, respectively, proving its good influence propagation effect. The above results demonstrate that the designed model can effectively spread influence. This helps to better understand and utilize the influence dissemination mechanisms in social networks, thereby promoting the development of social network research.

Authors

Institutions

Publication Details

Journal
Heliyon
Published
2024-10-04
DOI
https://doi.org/10.1016/j.heliyon.2024.e38916
Citations
2
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.56

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The influence maximization algorithm for integrating attribute graph clustering and heterogeneous graph transformer

Ziyao Liu, Wenzhan Zhang
2 citations
Heliyon
Complex Network Analysis Techniques
0.56
article

The influence maximization algorithm for integrating attribute graph clustering and heterogeneous graph transformer

Ziyao Liu, Wenzhan Zhang
article en
2 citations

Abstract

In social networks, maximizing influence is an important research direction. However, traditional influence maximization algorithms often overlook the attribute information of nodes and the heterogeneity of networks, leading to inefficiency and inaccuracy in the propagation process. To address this issue, this study first constructs a social network influence maximization propagation model, and then combines auto-encoder and graph convolutional autoencoder to extract social network user attributes. Finally, Transformer is used to learn the feature representation of social network nodes. Moreover, a heterogeneous graph neural network is introduced to combine with Transformer to further learn the feature representation of nodes, so as to design an influence maximization algorithm combining attributed graph clustering and heterogeneous graph Transformer. The results showed that the loss values of the fusion algorithm on different datasets were 0.619 and 0.17, respectively, proving its good fitting performance. The recall rate and F1 of this fusion algorithm were 92.5 % and 0.90, respectively, proving its high clustering accuracy. The influence maximization model based on fusion algorithm achieved active node coverage of 67 % and 48 % on two datasets, respectively, proving its good influence propagation effect. The above results demonstrate that the designed model can effectively spread influence. This helps to better understand and utilize the influence dissemination mechanisms in social networks, thereby promoting the development of social network research.

HeliyonVol. 10(21)
University of Science and Technology of China (CN)
University of Science and Technology of China
Openalex Percentile: Top 35%
Complex Network Analysis Techniques
0.56
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.