Graph neural networks for temporal graphs: State of the art, open challenges, and opportunities

A Longa, V Lachi, G Santin, M Bianchini, B Lepri… - arxiv preprint arxiv …, 2023 - arxiv.org
Graph Neural Networks (GNNs) have become the leading paradigm for learning on (static)
graph-structured data. However, many real-world systems are dynamic in nature, since the …

Hyperbolic variational graph neural network for modeling dynamic graphs

L Sun, Z Zhang, J Zhang, F Wang, H Peng… - Proceedings of the …, 2021 - ojs.aaai.org
Learning representations for graphs plays a critical role in a wide spectrum of downstream
applications. In this paper, we summarize the limitations of the prior works in three folds …

Rare Category Analysis for Complex Data: A Review

D Zhou, J He - ACM Computing Surveys, 2023 - dl.acm.org
Though the sheer volume of data that is collected is immense, it is the rare categories that
are often the most important in many high-impact domains, ranging from financial fraud …

Bright: A bridging algorithm for network alignment

Y Yan, S Zhang, H Tong - Proceedings of the web conference 2021, 2021 - dl.acm.org
Multiple networks emerge in a wealth of high-impact applications. Network alignment, which
aims to find the node correspondence across different networks, plays a fundamental role for …

Neural-answering logical queries on knowledge graphs

L Liu, B Du, H Ji, CX Zhai, H Tong - … of the 27th ACM SIGKDD conference …, 2021 - dl.acm.org
Logical queries constitute an important subset of questions posed in knowledge graph
question answering systems. Yet, effectively answering logical queries on large knowledge …

A self-supervised riemannian gnn with time varying curvature for temporal graph learning

L Sun, J Ye, H Peng, PS Yu - Proceedings of the 31st ACM international …, 2022 - dl.acm.org
Representation learning on temporal graphs has drawn considerable research attention
owing to its fundamental importance in a wide spectrum of real-world applications. Though a …

Higher-order memory guided temporal random walk for dynamic heterogeneous network embedding

C Ji, T Zhao, Q Sun, X Fu, J Li - Pattern Recognition, 2023 - Elsevier
Network embedding (NE) aims at learning node embeddings via structure-based sampling.
However, there are complex patterns in network structure (heterogeneity, higher-order …

CAT-walk: Inductive hypergraph learning via set walks

A Behrouz, F Hashemi… - Advances in Neural …, 2023 - proceedings.neurips.cc
Temporal hypergraphs provide a powerful paradigm for modeling time-dependent, higher-
order interactions in complex systems. Representation learning for hypergraphs is essential …

Heterogeneous information network embedding with adversarial disentangler

R Wang, C Shi, T Zhao, X Wang… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Heterogeneous information network (HIN) embedding has gained considerable attention in
recent years, which learns low-dimensional representation of nodes while preserving the …

High-order structure exploration on massive graphs: A local graph clustering perspective

D Zhou, S Zhang, MY Yildirim, S Alcorn… - ACM Transactions on …, 2021 - dl.acm.org
Modeling and exploring high-order connectivity patterns, also called network motifs, are
essential for understanding the fundamental structures that control and mediate the behavior …