LeL-GNN: Learnable Edge Sampling and Line Based Graph Neural Network for Link Prediction
Graph neural networks lose a lot of their computing power when more network layers are added. As a result, the majority of existing graph neural networks have a shallow depth of learning. Over-smoothing and information loss are two of the key issues that restrict graph neural networks from going dee...
Main Authors: | Md Golam Morshed, Tangina Sultana, Young-Koo Lee |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10144318/ |
Similar Items
Similar Items
-
Splices, Links, and their Edge-Degree Distances
by: Mahdieh Azari, et al.
Published: (2017-12-01) -
Edge-Transitivity of Cayley Graphs Generated by Transpositions
by: Ganesan Ashwin
Published: (2016-11-01) -
Some new results on the edge-strength and strength of graphs
by: Rikio Ichishima, et al.
Published: (2023-03-01) -
Local edge coloring of graphs
by: P. Deepa, et al.
Published: (2021-01-01) -
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
by: Lutz Volkmann, et al.
Published: (2017-01-01)