CTGCN learns dynamic graph embeddings preserving both local and global graph structure.
problem Learning node representations for evolving graphs while preserving both local and global graph structure.
method CTGCN uses k-core based temporal graph convolutional network to learn dynamic graph embeddings.
result CTGCN outperforms existing methods in link prediction and structural role classification.
Framework for dynamic node embeddings from graph streams.
problem Temporal prediction-based applications using graph stream data.
method ε-graph time-series representation, temporal reachability graphs, weighted temporal summary graphs.
result Dynamic embedding methods achieve better predictive performance.
Dynamic Embedding learns text node representations in evolving graphs.
problem Learning text node embeddings in dynamic graphs.
method DetGP model using Gaussian process for non-parametric structure learning.
result DetGP efficiently updates embeddings for dynamic graphs without re-training.
Improves scalability and robustness of dynamic graph clustering.
problem Scalability and robustness issues in matrix factorization methods for dynamic graphs.
method Temporal separated matrix factorization, bi-clustering regularization, selective embedding updating.
result Demonstrated scalability, robustness, and effectiveness on synthetic and real-world benchmarks.
Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…
Most of real-world graphs are dynamic, i.e., they change over time by a sequence of update operations. While the regression problem has been studied for static graphs and temporal graphs, it is not investigated for general dynamic graphs. In this paper, we study regression over dynamic graphs. First, we present the not…
Introduces PELP for graph-enhanced word embeddings.
problem Combining graph side-information into static word embeddings.
method Probabilistic embeddings using Laplacian priors.
result Unified and flexible approach to various embedding methods.
DBGDGM models dynamic brain graphs for better understanding brain function.
problem Previous brain graph models ignore temporal dynamics, limiting their usefulness.
method DBGDGM clusters brain regions into evolving communities and learns dynamic node embeddings.
result DBGDGM outperforms baselines in graph generation, dynamic link prediction, and graph classification.
Framework learns dynamic graph attributes and links co-evolution.
problem Forecasting change of node attributes and link formation in dynamic graphs.
method CoEvoGNN framework with temporal self-attention and joint optimization.
result Framework outperforms baselines on predicting unseen graph snapshots.
How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep, an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embe…
Proposes RNNE for dynamic network embedding.
problem Handling dynamic networks with changing node and edge counts.
method Recurrent Neural Network Embedding (RNNE) for topologically evolving graphs and temporal graphs.
result RNNE outperforms state-of-the-art algorithms in network reconstruction, classification, and link prediction.
Method analyzes large-scale network data to detect communication pattern shifts.
problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.
TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.
problem Learning node embeddings for dynamic graphs with evolving topological structures and temporal patterns.
method Temporal Graph Attention (TGAT) layer using self-attention and functional time encoding.
result TGAT model can inductively infer node embeddings for new and observed nodes as the graph evolves.
Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of accurately modeling the temporal information, most embedding methods ignore it …
We propose a simple discrete time semi-supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross-sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past…
New method embeds dynamic networks with stability for node behavior.
problem Embed time-evolving node representations with stability.
method Unfolded adjacency spectral embedding for dynamic networks.
result Method satisfies cross-sectional and longitudinal stability.
Enhances LightGCN for credit bond recommendations with dynamic node embeddings.
problem Challenges in static embeddings for rapidly evolving user interests in finance.
method Causal graph convolution for dynamic node embeddings over chronological user-item interactions.
result Significantly enhances LightGCN performance in financial product recommendations.
TM-GCN learns dynamic graph embeddings using tensor algebra.
problem Handling dynamic graphs in graph neural networks.
method Tensor M-product for dynamic graph convolution.
result TM-GCN outperforms existing methods on edge classification and link prediction.
Representation learning on graphs has emerged as a powerful mechanism to automate feature vector generation for downstream machine learning tasks. The advances in representation on graphs have centered on both homogeneous and heterogeneous graphs, where the latter presenting the challenges associated with multi-typed n…
A new method uses matrix sketches for efficient graph clustering in dynamic environments.
problem Efficiently clustering large, dynamic graphs in distributed memory systems.
method Inspired by spectral clustering, the approach uses random dimension-reducing projections to derive matrix sketches.
result The method produces embeddings that yield performant clustering results in a fully-dynamic stochastic block model stream.
Graph representation learning resurges as a trending research subject owing to the widespread use of deep learning for Euclidean data, which inspire various creative designs of neural networks in the non-Euclidean domain, particularly graphs. With the success of these graph neural networks (GNN) in the static setting, …
Novel method detects changes in noisy dynamic networks.
problem Change detection in noisy dynamic networks with sparsity and degree heterogeneity.
method Adapted Procrustes analysis to embedded points for vertices in spectral embedding.
result CDP successfully detects various types of vertex-based changes.
Dyn-VGAE learns evolving network structures.
problem Learning dynamic network representations.
method Dynamic joint Variational Graph Autoencoders (Dyn-VGAE).
result Dyn-VGAE captures temporal evolution in dynamic networks.
IDGL learns better graph structure and embeddings iteratively.
problem Improving graph neural network node embeddings and graph structure.
method Iterative Deep Graph Learning framework that dynamically stops when graph structure optimizes for downstream tasks.
result IDGL consistently outperforms state-of-the-art baselines on nine benchmarks.
The monitoring of large dynamic networks is a major chal- lenge for a wide range of application. The complexity stems from properties of the underlying graphs, in which slight local changes can lead to sizable variations of global prop- erties, e.g., under certain conditions, a single link cut that may be overlooked du…
asp2vec learns dynamic node aspect distributions for better network embedding.
problem Lack of multi-aspect node representations in network embedding.
method Dynamic aspect assignment via Gumbel-Softmax and aspect regularization.
result Improved network embedding quality through dynamic aspect modeling.
Learning latent representations of nodes in graphs is an important and ubiquitous task with widespread applications such as link prediction, node classification, and graph visualization. Previous methods on graph representation learning mainly focus on static graphs, however, many real-world graphs are dynamic and evol…
We establish a correspondence between the dimer model on a bipartite graph and a circle pattern with the combinatorics of that graph, which holds for graphs that are either planar or embedded on the torus. The set of positive face weights on the graph gives a set of global coordinates on the space of circle patterns wi…
Study connects flow dynamics to 3D geometry via surface intersections.
problem Relating flow dynamics to geometric properties of 3-manifolds.
method Relates pseudo-Anosov flow dynamics to hyperbolic geometry via curve graphs.
result Established a link between flow invariants and geometric features of 3-manifolds.
DArtNet predicts time series data using graph structure and dynamic attributes.
problem Predicting time series data using graph structure and dynamic attributes.
method DArtNet learns static and dynamic embeddings for graph nodes and encodes history information using RNN for joint link and attribute prediction.
result Improved time series prediction accuracy on five datasets.
In a graph convolutional network, we assume that the graph G is generated wrt some observation noise. During learning, we make small random perturbations ΔG of the graph and try to improve generalization. Based on quantum information geometry, ΔG can be characterized by the eigendecomposition of the graph Laplaci…
Proposes a new graph representation method using tensor products.
problem Dynamic graph representation and theoretical properties.
method Bind-and-sum approach in hyperdimensional computing (HDC), tensor product as binding operation.
result Memory vs. size analysis of graph representation size scaling.
Graph learning captures financial dynamics over time.
problem Understanding the evolving patterns in financial interactions.
method Graph Representation Learning applied to a dynamic financial graph.
result Captured latent trajectories reveal insights into economic events.
DGE learns event representations from image sequences without manual annotations.
problem Data hunger and domain adaptation issues in self-supervised learning for temporal segmentation.
method Dynamic Graph Embedding (DGE) learns event representations by iteratively updating a graph and its embedding.
result DGE achieves robust temporal segmentation on benchmark datasets, outperforming state-of-the-art methods.
In this work, we present a method for node embedding in temporal graphs. We propose an algorithm that learns the evolution of a temporal graph's nodes and edges over time and incorporates this dynamics in a temporal node embedding framework for different graph prediction tasks. We present a joint loss function that cre…
AMES framework selects optimal embedding space for latent graph inference.
problem No principled method for choosing the best embedding space for latent graph inference.
method Differentiable AMES framework using backpropagation to select optimal embedding space.
result Consistently achieves comparable or superior results across multiple datasets.
New method to classify simple Smale flows on S3.
problem Classifying simple Smale flows on S3. method Embedded template and Kauffman's invariant of spatial graphs.
result Isotopic classification of simple Smale flows on S3. MTHetGNN models complex relations in multivariate time series forecasting.
problem Complex relations among variables in multivariate time series forecasting.
method Designs a relation embedding module and a temporal embedding module, using graph neural networks and CNNs.
result Achieves state-of-the-art results in multivariate time series forecasting.
DynamicGEM is an open-source Python library for learning node representations of dynamic graphs. It consists of state-of-the-art algorithms for defining embeddings of nodes whose connections evolve over time. The library also contains the evaluation framework for four downstream tasks on the network: graph reconstructi…
GraphKKE learns fixed-length feature vectors from time-evolving graphs of human microbiome data.
problem Understanding dynamic changes in human microbiome graphs over time.
method Spectral analysis of transfer operators and graph kernels.
result GraphKKE captures temporal changes in human microbiome graphs.
Proposes DIAL-GNN for joint graph structure and embedding learning.
problem Joint learning of graph structure and embeddings.
method Adapted graph regularization, iterative method for graph structure learning.
result Consistently outperforms state-of-the-art baselines in downstream tasks and computational time.
Graph embedding is a popular algorithmic approach for creating vector representations for individual vertices in networks. Training these algorithms at scale is important for creating embeddings that can be used for classification, ranking, recommendation and other common applications in industry. While industrial syst…
DEMOTE uses neural diffusion-reaction processes to capture temporal dynamics in sparse tensor data.
problem Sparse and temporally associated tensor data with limited structural knowledge.
method Develops a neural diffusion-reaction process to estimate dynamic embeddings for tensor modes.
result Captures both commonalities and personalities in evolving tensor entries.
StrGNN detects anomalies in dynamic graphs by analyzing subgraphs and temporal features.
problem Detecting anomalies in dynamic graphs with structural changes.
method StrGNN is an end-to-end model that uses structural subgraphs and temporal features for anomaly detection.
result StrGNN effectively detects anomalies in dynamic graphs, as shown by extensive experiments.
New algorithm updates eigenvectors of evolving graphs efficiently.
problem Updating eigenvectors of dynamic graphs.
method Subspace projection based on Rayleigh-Ritz projections.
result Strong performance in eigenvector approximation and downstream tasks.
DGRCL integrates dynamic and static graph relations for financial market prediction.
problem Capturing the evolving nature of stock markets while considering both temporal changes and static relational structures.
method Dynamic Graph Representation with Contrastive Learning (DGRCL) framework, including Embedding Enhancement (EE) and Contrastive Constrained Training (CCT) modules.
result DGRCL significantly outperforms state-of-the-art TGL baselines on NASDAQ and NYSE datasets.
A model for POI recommendation using relation embedding.
problem Challenges in POI recommendation due to sparse user-POI matrix and varying context.
method Translation-based relation embedding using Knowledge Graph Embedding techniques, combined matrix factorization framework.
result Demonstrates effectiveness of the proposed model on real-world datasets.
Proposes a new method to extract time-aware shapelets for better time series modeling.
problem Challenges in achieving reliable efficiency and interpretability in time series modeling.
method Designs a two-level timing factor to extract time-aware shapelets and constructs a shapelet evolution graph.
result Improves time series modeling by extracting time-aware shapelets and incorporating them into embeddings.