paper-with-me

Papers

Multi-hop Graph Convolutional Network with High-order Chebyshev Approximation for Text Reasoning

2021-06-08 · ACL 2021 5 · Shuoran Jiang, Qingcai Chen, Xin Liu, Baotian Hu, Lisai Zhang

Graph convolutional network (GCN) has become popular in various natural language processing (NLP) tasks with its superiority in long-term and non-consecutive word interactions. However, existing single-hop graph reasoning in GCN may miss some important non-consecutive dependencies. In this study, we define the spectral graph convolutional network with the high-order dynamic Chebyshev approximation (HDGCN), which augments the multi-hop graph reasoning by fusing messages aggregated from direct and long-term dependencies into one convolutional layer. To alleviate the over-smoothing in high-order Chebyshev approximation, a multi-vote-based cross-attention (MVCAttn) with linear computation complexity is also proposed. The empirical results on four transductive and inductive NLP tasks and the ablation study verify the efficacy of the proposed model. Our source code is available at https://github.com/MathIsAll/HDGCN-pytorch.

📄 PDF Abstract BibTeX arXiv:2106.05221

Code (1)

MathIsAll/HDGCN-pytorch 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

GCN A Graph Convolutional Network, or GCN, is an approach for semi-supervised learning on graph-structured data. It is based on an efficient variant of [convolutional neural…

Similar Papers 제목 키워드 기반

Enhanced Graph Convolutional Network with Chebyshev Spectral Graph and Graph Attention for Autism Spectrum Disorder Classification

2025-11-27 · Adnan Ferdous Ashrafi, Hasanul Kabir arxiv

ASD is a complicated neurodevelopmental disorder marked by variation in symptom presentation and neurological underpinnings, making early and objective diagnosis extremely problematic. This paper presents a Graph Convolu…

Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited

2022-02-04 · Mingguo He, Zhewei Wei, Ji-Rong Wen

Designing spectral convolutional networks is a challenging problem in graph learning. ChebNet, one of the early attempts, approximates the spectral graph convolutions using Chebyshev polynomials. GCN simplifies ChebNet b…

GPRGraph LearningNode Classification

Learning Chebyshev Basis in Graph Convolutional Networks for Skeleton-based Action Recognition

2021-04-12 · Hichem Sahbi

Spectral graph convolutional networks (GCNs) are particular deep models which aim at extending neural networks to arbitrary irregular domains. The principle of these networks consists in projecting graph signals using th…

Action RecognitionSkeleton Based Action Recognition

Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules

2018-11-23 · Boris Knyazev, Xiao Lin, Mohamed R. Amer, Graham W. Taylor

Spectral Graph Convolutional Networks (GCNs) are a generalization of convolutional networks to learning on graph-structured data. Applications of spectral GCNs have been successful, but limited to a few problems where th…

ClassificationGeneral ClassificationGraph ClassificationNode Classification

From ChebNet to ChebGibbsNet

2024-12-02 · Jie Zhang, Min-Te Sun

Recent advancements in Spectral Graph Convolutional Networks (SpecGCNs) have led to state-of-the-art performance in various graph representation learning tasks. To exploit the potential of SpecGCNs, we analyze correspond…

Graph Representation LearningNode ClassificationRepresentation Learning