Encoder-Decoder Architecture for Supervised Dynamic Graph Learning: A Survey
In recent years, the prevalent online services generate a sheer volume of user activity data. Service providers collect these data in order to perform client behavior analysis, and offer better and more customized services. Majority of these data can be modeled and stored as graph, such as the social graph in Facebook, user-video interaction graph in Youtube. These graphs need to evolve over time to capture the dynamics in the real world, leading to the invention of dynamic graphs. However, the temporal information embedded in the dynamic graphs brings new challenges in analyzing and deploying them. Events staleness, temporal information learning and explicit time dimension usage are some example challenges in dynamic graph learning. In order to offer a convenient reference to both the industry and academia, this survey presents the Three Stages Recurrent Temporal Learning Framework based on dynamic graph evolution theories, so as to interpret the learning of temporal information with a generalized framework. Under this framework, this survey categories and reviews different learnable encoder-decoder architectures for supervised dynamic graph learning. We believe that this survey could supply useful guidelines to researchers and engineers in finding suitable graph structures for their dynamic learning tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
DecoderGraph LearningSurveyMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning to Represent the Evolution of Dynamic Graphs with Recurrent Models
Graph representation learning for static graphs is a well studied topic. Recently, a few studies have focused on learning temporal information in addition to the topology of a graph. Most of these studies have relied on …
DecoderGraph ClassificationGraph Representation LearningRepresentation LearningGraph Attention Auto-Encoders
Auto-encoders have emerged as a successful framework for unsupervised learning. However, conventional auto-encoders are incapable of utilizing explicit relations in structured data. To take advantage of relations in grap…
DecoderGraph AttentionInductive LearningNode Classification+1Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learning
We propose a symmetric graph convolutional autoencoder which produces a low-dimensional latent representation from a graph. In contrast to the existing graph autoencoders with asymmetric decoder parts, the proposed autoe…
ClusteringDecoderGraph ClusteringGraph Representation Learning+3Deep Unsupervised Learning of 3D Point Clouds via Graph Topology Inference and Filtering
We propose a deep autoencoder with graph topology inference and filtering to achieve compact representations of unorganized 3D point clouds in an unsupervised manner. Many previous works discretize 3D points to voxels an…
3D Point Cloud ReconstructionDecoderGeneral ClassificationPoint cloud reconstructionGRASPED: Graph Anomaly Detection using Autoencoder with Spectral Encoder and Decoder (Full Version)
Graph machine learning has been widely explored in various domains, such as community detection, transaction analysis, and recommendation systems. In these applications, anomaly detection plays an important role. Recentl…
Graph Anomaly DetectionRecommendation SystemsCommunity Detection