A Survey on Embedding Dynamic Graphs

• URL: http://arxiv.org/abs/2101.01229v1
• Date: Mon, 4 Jan 2021 20:35:26 GMT
• Title: A Survey on Embedding Dynamic Graphs
• Authors: Claudio D. T. Barros (1), Matheus R. F. Mendon\c{c}a (1), Alex B. Vieira (2), Artur Ziviani (1) ((1) National Laboratory for Scientific Computing (LNCC), Petr\'opolis, RJ, Brazil, (2) Federal University of Juiz de Fora (UFJF), Juiz de Fora, MG, Brazil)
• Abstract summary: We overview dynamic graph embedding, discussing its fundamentals and the recent advances developed so far. We introduce the formal definition of dynamic graph embedding, focusing on the problem setting. We explore different dynamic behaviors that may be encompassed by embeddings, classifying by topological evolution, feature evolution, and processes on networks.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks present dynamic behavior, including topological evolution, feature evolution, and diffusion. Therefore, several methods for embedding dynamic graphs have been proposed to learn network representations over time, facing novel challenges, such as time-domain modeling, temporal features to be captured, and the temporal granularity to be embedded. In this survey, we overview dynamic graph embedding, discussing its fundamentals and the recent advances developed so far. We introduce the formal definition of dynamic graph embedding, focusing on the problem setting and introducing a novel taxonomy for dynamic graph embedding input and output. We further explore different dynamic behaviors that may be encompassed by embeddings, classifying by topological evolution, feature evolution, and processes on networks. Afterward, we describe existing techniques and propose a taxonomy for dynamic graph embedding techniques based on algorithmic approaches, from matrix and tensor factorization to deep learning, random walks, and temporal point processes. We also elucidate main applications, including dynamic link prediction, anomaly detection, and diffusion prediction, and we further state some promising research directions in the area.

Related papers

• Information propagation dynamics in Deep Graph Networks [1.8130068086063336]
  Deep Graph Networks (DGNs) have emerged as a family of deep learning models that can process and learn structured information. This thesis investigates the dynamics of information propagation within DGNs for static and dynamic graphs, focusing on their design as dynamical systems.
  arXiv  Detail & Related papers  (2024-10-14T12:55:51Z)
• Gradient Transformation: Towards Efficient and Model-Agnostic Unlearning for Dynamic Graph Neural Networks [66.70786325911124]
  Graph unlearning has emerged as an essential tool for safeguarding user privacy and mitigating the negative impacts of undesirable data. With the increasing prevalence of DGNNs, it becomes imperative to investigate the implementation of dynamic graph unlearning. We propose an effective, efficient, model-agnostic, and post-processing method to implement DGNN unlearning.
  arXiv  Detail & Related papers  (2024-05-23T10:26:18Z)
• Node-Time Conditional Prompt Learning In Dynamic Graphs [14.62182210205324]
  We propose DYGPROMPT, a novel pre-training and prompt learning framework for dynamic graph modeling. We recognize that node and time features mutually characterize each other, and propose dual condition-nets to model the evolving node-time patterns in downstream tasks.
  arXiv  Detail & Related papers  (2024-05-22T19:10:24Z)
• Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning [53.81365215811222]
  We provide a review and summary of the latest approaches, strategies, and insights that address distribution shifts within the context of graph learning. We categorize existing graph learning methods into several essential scenarios, including graph domain adaptation learning, graph out-of-distribution learning, and graph continual learning. We discuss the potential applications and future directions for graph learning under distribution shifts with a systematic analysis of the current state in this field.
  arXiv  Detail & Related papers  (2024-02-26T07:52:40Z)
• Towards Graph Foundation Models: A Survey and Beyond [66.37994863159861]
  Foundation models have emerged as critical components in a variety of artificial intelligence applications. The capabilities of foundation models to generalize and adapt motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm. This article introduces the concept of Graph Foundation Models (GFMs), and offers an exhaustive explanation of their key characteristics and underlying technologies.
  arXiv  Detail & Related papers  (2023-10-18T09:31:21Z)
• Dynamic Graph Representation Learning with Neural Networks: A Survey [0.0]
  Dynamic graph representations have emerged as a new machine learning problem. This paper aims at providing a review of problems and models related to dynamic graph learning.
  arXiv  Detail & Related papers  (2023-04-12T09:39:17Z)
• Learning Dynamic Graph Embeddings with Neural Controlled Differential Equations [21.936437653875245]
  This paper focuses on representation learning for dynamic graphs with temporal interactions. We propose a generic differential model for dynamic graphs that characterises the continuously dynamic evolution of node embedding trajectories. Our framework exhibits several desirable characteristics, including the ability to express dynamics on evolving graphs without integration by segments.
  arXiv  Detail & Related papers  (2023-02-22T12:59:38Z)
• Self-Supervised Graph Representation Learning for Neuronal Morphologies [75.38832711445421]
  We present GraphDINO, a data-driven approach to learn low-dimensional representations of 3D neuronal morphologies from unlabeled datasets. We show, in two different species and across multiple brain areas, that this method yields morphological cell type clusterings on par with manual feature-based classification by experts. Our method could potentially enable data-driven discovery of novel morphological features and cell types in large-scale datasets.
  arXiv  Detail & Related papers  (2021-12-23T12:17:47Z)
• TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
  We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion. To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
  arXiv  Detail & Related papers  (2021-05-17T15:33:25Z)
• Towards Deeper Graph Neural Networks [63.46470695525957]
  Graph convolutions perform neighborhood aggregation and represent one of the most important graph operations. Several recent studies attribute this performance deterioration to the over-smoothing issue. We propose Deep Adaptive Graph Neural Network (DAGNN) to adaptively incorporate information from large receptive fields.
  arXiv  Detail & Related papers  (2020-07-18T01:11:14Z)
• EvoNet: A Neural Network for Predicting the Evolution of Dynamic Graphs [26.77596449192451]
  We propose a model that predicts the evolution of dynamic graphs. Specifically, we use a graph neural network along with a recurrent architecture to capture the temporal evolution patterns of dynamic graphs. We evaluate the proposed model on several artificial datasets following common network evolving dynamics, as well as on real-world datasets.
  arXiv  Detail & Related papers  (2020-03-02T12:59:05Z)

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.