.png){kind=icon}
.png){kind=icon}
Return
GCNFusion: An efficient graph convolutional network based model for information diffusion
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2022.117053.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Investigating the dynamics of spreading processes in real-world applications such as pathogen spread prediction, marketing, political events, etc has attracted the attention of researchers from a variety of fields. Influence-based information diffusion is one convincing attempt to solve the information diffusion problem. In this regard, most of the attempts suffer from certain drawbacks such as complexity, dependency on the underlying diffusion model, or low prediction accuracy. We have looked at this problem from a fresh perspective and come up with an innovative solution for solving it. Our hybrid approach falls at the intersection of three research areas: feature selection, graph embedding, and information dissemination. To discover the influential nodes in a network, we develop a method comparable to wrapper methods in feature selection, in which we employ the strength of graph convolutional neural networks (GCNs). The results of our implementation in Python on five datasets Cora, Email, Hamster, Router, and CEnew, under the susceptibleinfected-recovered (SIR) model, approved that GCNFusion exceptionally outperforms benchmark methods by respectively around 3%, 5%, 5%, 2%, and 3%. Furthermore, the proposed method is a decent suit for real-world applications on complex networks due to its low computational complexity.
Keywords:
Feature selection
Graph embedding
Graph neural networks
Influential nodes
Information diffusion
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W
Organization
View more organizations