THeGCN: Temporal Heterophilic Graph Convolutional Network

• URL: http://arxiv.org/abs/2412.16435v2
• Date: Fri, 10 Jan 2025 19:49:12 GMT
• Title: THeGCN: Temporal Heterophilic Graph Convolutional Network
• Authors: Yuchen Yan, Yuzhong Chen, Huiyuan Chen, Xiaoting Li, Zhe Xu, Zhichen Zeng, Lihui Liu, Zhining Liu, Hanghang Tong,
• Abstract summary: We propose the Temporal Heterophilic Graph Convolutional Network (THeGCN) to accurately capture both edge (spatial) heterophily and temporal heterophily. The THeGCN model consists of two key components: a sampler and an aggregator. Extensive experiments conducted on 5 real-world datasets validate the efficacy of THeGCN.
• Score: 51.25112923442657
• License:
• Abstract: Graph Neural Networks (GNNs) have exhibited remarkable efficacy in diverse graph learning tasks, particularly on static homophilic graphs. Recent attention has pivoted towards more intricate structures, encompassing (1) static heterophilic graphs encountering the edge heterophily issue in the spatial domain and (2) event-based continuous graphs in the temporal domain. State-of-the-art (SOTA) has been concurrently addressing these two lines of work but tends to overlook the presence of heterophily in the temporal domain, constituting the temporal heterophily issue. Furthermore, we highlight that the edge heterophily issue and the temporal heterophily issue often co-exist in event-based continuous graphs, giving rise to the temporal edge heterophily challenge. To tackle this challenge, this paper first introduces the temporal edge heterophily measurement. Subsequently, we propose the Temporal Heterophilic Graph Convolutional Network (THeGCN), an innovative model that incorporates the low/high-pass graph signal filtering technique to accurately capture both edge (spatial) heterophily and temporal heterophily. Specifically, the THeGCN model consists of two key components: a sampler and an aggregator. The sampler selects events relevant to a node at a given moment. Then, the aggregator executes message-passing, encoding temporal information, node attributes, and edge attributes into node embeddings. Extensive experiments conducted on 5 real-world datasets validate the efficacy of THeGCN.

Related papers

• Dual-Frequency Filtering Self-aware Graph Neural Networks for Homophilic and Heterophilic Graphs [60.82508765185161]
  We propose Dual-Frequency Filtering Self-aware Graph Neural Networks (DFGNN) DFGNN integrates low-pass and high-pass filters to extract smooth and detailed topological features. It dynamically adjusts filtering ratios to accommodate both homophilic and heterophilic graphs.
  arXiv  Detail & Related papers  (2024-11-18T04:57:05Z)
• DuoGNN: Topology-aware Graph Neural Network with Homophily and Heterophily Interaction-Decoupling [0.0]
  Graph Neural Networks (GNNs) have proven effective in various medical imaging applications, such as automated disease diagnosis. They inherently suffer from two fundamental limitations: first, indistinguishable node embeddings due to heterophilic node aggregation. We propose DuoGNN, a scalable and generalizable architecture which leverages topology to decouple homophilic and heterophilic edges.
  arXiv  Detail & Related papers  (2024-09-29T09:01:22Z)
• The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges [101.83124435649358]
  Homophily principle, ie nodes with the same labels or similar attributes are more likely to be connected. Recent work has identified a non-trivial set of datasets where GNN's performance compared to the NN's is not satisfactory.
  arXiv  Detail & Related papers  (2024-07-12T18:04:32Z)
• Gaussian Embedding of Temporal Networks [12.09704836128003]
  TGNE (textbfTemporal textbfGaussian textbfNetwork textbfEmbedding) bridges statistical analysis of networks via Latent Space Models (LSM)citeHoff2002 and temporal graph machine learning. We evaluate TGNE's effectiveness in reconstructing the original graph and modelling uncertainty.
  arXiv  Detail & Related papers  (2024-05-27T15:07:57Z)
• CTRL: Continuous-Time Representation Learning on Temporal Heterogeneous Information Network [32.42051167404171]
  We propose a Continuous-Time Representation Learning model on temporal HINs. We train the model with a future event (a subgraph) prediction task to capture the evolution of the high-order network structure. The results demonstrate that our model significantly boosts performance and outperforms various state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-05-11T03:39:22Z)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splitting [32.69196871253339]
  We propose a novel Edge Splitting GNN (ES-GNN) framework to adaptively distinguish between graph edges either relevant or irrelevant to learning tasks. We show that our ES-GNN can be regarded as a solution to a disentangled graph denoising problem.
  arXiv  Detail & Related papers  (2022-05-27T01:29:03Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Space-Time Graph Neural Networks [104.55175325870195]
  We introduce space-time graph neural network (ST-GNN) to jointly process the underlying space-time topology of time-varying network data. Our analysis shows that small variations in the network topology and time evolution of a system does not significantly affect the performance of ST-GNNs.
  arXiv  Detail & Related papers  (2021-10-06T16:08:44Z)
• TG-GAN: Continuous-time Temporal Graph Generation with Deep Generative Models [9.75258136573147]
  We propose a new model, called Temporal Graph Generative Adversarial Network'' (TG-GAN) for continuous-time temporal graph generation. We first propose a novel temporal graph generator that jointly model truncated edge sequences, time budgets, and node attributes. In addition, a new temporal graph discriminator is proposed, which combines time and node encoding operations over a recurrent architecture to distinguish the generated sequences.
  arXiv  Detail & Related papers  (2020-05-17T17:59:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.