Neural Higher-order Pattern (Motif) Prediction in Temporal Networks
- URL: http://arxiv.org/abs/2106.06039v1
- Date: Thu, 10 Jun 2021 20:42:41 GMT
- Title: Neural Higher-order Pattern (Motif) Prediction in Temporal Networks
- Authors: Yunyu Liu, Jianzhu Ma, Pan Li
- Abstract summary: We propose the first model, named HIT, for higher-order pattern prediction in temporal hypergraphs.
Hitt extracts the structural representation of a node triplet of interest on the temporal hypergraph and uses it to tell what type of, when, and why the interaction expansion could happen in this triplet.
- Score: 9.717332900439432
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Dynamic systems that consist of a set of interacting elements can be
abstracted as temporal networks. Recently, higher-order patterns that involve
multiple interacting nodes have been found crucial to indicate domain-specific
laws of different temporal networks. This posts us the challenge of designing
more sophisticated hypergraph models for these higher-order patterns and the
associated new learning algorithms. Here, we propose the first model, named
HIT, for higher-order pattern prediction in temporal hypergraphs. Particularly,
we focus on predicting three types of common but important interaction patterns
involving three interacting elements in temporal networks, which could be
extended to even higher-order patterns. HIT extracts the structural
representation of a node triplet of interest on the temporal hypergraph and
uses it to tell what type of, when, and why the interaction expansion could
happen in this triplet. HIT could achieve significant improvement(averaged 20%
AUC gain to identify the interaction type, uniformly more accurate time
estimation) compared to both heuristic and other neural-network-based baselines
on 5 real-world large temporal hypergraphs. Moreover, HIT provides a certain
degree of interpretability by identifying the most discriminatory structural
features on the temporal hypergraphs for predicting different higher-order
patterns.
Related papers
- 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) - Interaction Event Forecasting in Multi-Relational Recursive HyperGraphs: A Temporal Point Process Approach [12.142292322071299]
This work addresses the problem of forecasting higher-order interaction events in multi-relational recursive hypergraphs.
The proposed model, textitRelational Recursive Hyperedge Temporal Point Process (RRHyperTPP), uses an encoder that learns a dynamic node representation based on the historical interaction patterns.
We have experimentally shown that our models perform better than previous state-of-the-art methods for interaction forecasting.
arXiv Detail & Related papers (2024-04-27T15:46:54Z) - MSHyper: Multi-Scale Hypergraph Transformer for Long-Range Time Series
Forecasting [7.178309082582536]
We propose a Multi-Scale Hypergraph Transformer (MSHyper) framework to promote more comprehensive pattern interaction modeling.
MSHyper achieves state-of-the-art performance, reducing prediction errors by an average of 8.73% and 7.15% over the best baseline in MSE and MAE, respectively.
arXiv Detail & Related papers (2024-01-17T15:12:11Z) - From Hypergraph Energy Functions to Hypergraph Neural Networks [94.88564151540459]
We present an expressive family of parameterized, hypergraph-regularized energy functions.
We then demonstrate how minimizers of these energies effectively serve as node embeddings.
We draw parallels between the proposed bilevel hypergraph optimization, and existing GNN architectures in common use.
arXiv Detail & Related papers (2023-06-16T04:40:59Z) - MTS2Graph: Interpretable Multivariate Time Series Classification with
Temporal Evolving Graphs [1.1756822700775666]
We introduce a new framework for interpreting time series data by extracting and clustering the input representative patterns.
We run experiments on eight datasets of the UCR/UEA archive, along with HAR and PAM datasets.
arXiv Detail & Related papers (2023-06-06T16:24:27Z) - Tensorized Hypergraph Neural Networks [69.65385474777031]
We propose a novel adjacency-tensor-based textbfTensorized textbfHypergraph textbfNeural textbfNetwork (THNN)
THNN is faithful hypergraph modeling framework through high-order outer product feature passing message.
Results from experiments on two widely used hypergraph datasets for 3-D visual object classification show the model's promising performance.
arXiv Detail & Related papers (2023-06-05T03:26:06Z) - 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) - Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment [53.72873672076391]
Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information.
We propose a self-supervised method called S2T for temporal graph learning, which extracts both temporal and structural information.
S2T achieves at most 10.13% performance improvement compared with the state-of-the-art competitors on several datasets.
arXiv Detail & Related papers (2023-02-15T06:36:04Z) - Neural Temporal Point Process for Forecasting Higher Order and Directional Interactions [10.803714426078642]
We propose a deep neural network-based model textitDirected HyperNode Temporal Point Process for directed hyperedge event forecasting.
Our proposed technique reduces the search space by initially forecasting the nodes at which events will be observed.
Based on these, it generates candidate hyperedges, which are then used by a hyperedge predictor to identify the ground truth.
arXiv Detail & Related papers (2023-01-28T14:32:14Z) - Learning the Evolutionary and Multi-scale Graph Structure for
Multivariate Time Series Forecasting [50.901984244738806]
We show how to model the evolutionary and multi-scale interactions of time series.
In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations.
A unified neural network is provided to integrate the components above to get the final prediction.
arXiv Detail & Related papers (2022-06-28T08:11:12Z) - Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs [65.18780403244178]
We propose a continuous model to forecast Multivariate Time series with dynamic Graph neural Ordinary Differential Equations (MTGODE)
Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures.
Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing.
arXiv Detail & Related papers (2022-02-17T02:17:31Z)
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.