A Generic Edge-Empowered Graph Convolutional Network via Node-Edge Mutual Enhancement
Pengyang Wang, Jiaping Gui, Zhengzhang Chen, Junghwan Rhee, Haifeng Chen, Yanjie Fu
Abstract
Graph Convolutional Networks (GCNs) have shown to be a powerful tool for analyzing graph-structured data. Most of previous GCN methods focus on learning a good node representation by aggregating the representations of neighboring nodes, whereas largely ignoring the edge information. Although few recent methods have been proposed to integrate edge attributes into GCNs to initialize edge embeddings, these methods do not work when edge attributes are (partially) unavailable. Can we develop a generic edge-empowered framework to exploit node-edge enhancement, regardless of the availability of edge attributes? In this paper, we propose a novel framework EE-GCN that achieves node-edge enhancement. In particular, the framework EE-GCN includes three key components: (i) Initialization: this step is to initialize the embeddings of both nodes and edges. Unlike node embedding initialization, we propose a line graph-based method to initialize the embedding of edges regardless of edge attributes. (ii) Feature space alignment: we propose a translation-based mapping method to align edge embedding with node embedding space, and the objective function is penalized by a translation loss when both spaces are not aligned. (iii) Node-edge mutually enhanced updating: node embedding is updated by aggregating embedding of neighboring nodes and associated edges, while edge embedding is updated by the embedding of associated nodes and itself. Through the above improvements, our framework provides a generic strategy for all of the spatial-based GCNs to allow edges to participate in embedding computation and exploit node-edge mutual enhancement. Finally, we present extensive experimental results to validate the improved performances of our method in terms of node classification, link prediction, and graph classification.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 1867afa4-059c-4d7b-af92-466a45f5e8ffCited by top-tier papers2
- Neural Message Passing for Multi-Relational Ordered and Recursive HypergraphsNaganand YadatiNeurIPS 2020 · 64 citations
- SAFT: Structure-aware Transformers for Textual Interaction ClassificationHongtao Wang, Renchi Yang, Hewen Wang, Haoran Zheng et al.SIGIR 2025 · 1 citation
Related papers
- Adaptive Graph Encoder for Attributed Graph EmbeddingGanqu Cui, Jie Zhou, Cheng Yang, Zhiyuan LiuKDD 2020 · 224 citations
- Heterogeneous Graph Neural Network via Attribute CompletionDi Jin, Cuiying Huo, Chundong Liang, Liang YangWWW 2021 · 220 citations
- Enhanced Graph Learning for Collaborative Filtering via Mutual Information MaximizationYonghui Yang, Le Wu, Richang Hong, Kun Zhang et al.SIGIR 2021 · 112 citations
- Knowledge Embedding Based Graph Convolutional NetworkDonghan Yu, Yiming Yang, Ruohong Zhang, Yuexin WuWWW 2021 · 132 citations
- Edgeformers: Graph-Empowered Transformers for Representation Learning on Textual-Edge NetworksBowen Jin, Yu Zhang, Yu Meng, Jiawei HanICLR 2023 · 5 citations
