.png){kind=icon}
.png){kind=icon}
Return
Exploring an edge convolution and normalization based approach for link prediction in complex networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.jnca.2021.103113.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Link prediction in complex networks is to discover hidden or to-be-generated links between network nodes. Most of the mainstream graph neural network (GNN) based link prediction methods mainly focus on the representation learning of nodes, and are prone to over-smoothing problem. This paper dedicates to the representation learning of links, and designs an edge convolution operation so as to realize the link representation learning. Besides, we propose an normalization strategy for the learned link representation, for the purpose of alleviating the over-smoothing problem of edge convolution based link prediction model, when constructing the link prediction graph neural network EdgeConvNorm with stacking edge convolution manipulations. Lastly, we employ a binary classifier sigmod on the Hadamard product of two nodes representation parsed from the final learned link representation. The EdgeConvNorm can also be employed as a baseline, and extensive experiments on real-world benchmark complex networks validate that EdgeConvNorm not only alleviates the over-smoothing problem, but also has advantages over representative baselines.
Keywords:
Link prediction
Complex network
Graph neural network
Edge convolution
Normalization
Residual connection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
3.6K
Citations:
1.1W
Organization
No organization information available