Papers › Exploring the Role of Node Diversity in Directed Graph Representation Learning
Exploring the Role of Node Diversity in Directed Graph Representation Learning
Jincheng Huang, Yujie Mo, Ping Hu, Xiaoshuang Shi, Shangbo Yuan, Zeyu Zhang, Xiaofeng Zhu
Manymethods of Directed Graph Neural Networks (DGNNs) are designed to equally treat nodes in the same neighbor set (i.e., out-neighbor set and in-neighbor set) for every node, without consider ing the node diversity in directed graphs, so they are often unavailable to adaptively acquire suitable information from neighbors of different directions. To alleviate this issue, in this paper, we investigate a new way to first consider node diversity for rep resentation learning on directed graphs, i.e., neigh bor diversity and degree diversity, and then propose a new NDDGNN framework to adaptively assign weights to both outgoing information and incom ing information at the node level. Extensive ex periments on seven real-world datasets validate the superior performance of our method compared to state-of-the-art methods in terms of both node clas sification and link prediction tasks.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections