Unsupervised Deep Manifold Attributed Graph Embedding
Unsupervised attributed graph representation learning is challenging since both structural and feature information are required to be represented in the latent space. Existing methods concentrate on learning latent representation via reconstruction tasks, but cannot directly optimize representation and are prone to oversmoothing, thus limiting the applications on downstream tasks. To alleviate these issues, we propose a novel graph embedding framework named Deep Manifold Attributed Graph Embedding (DMAGE). A node-to-node geodesic similarity is proposed to compute the inter-node similarity between the data space and the latent space and then use Bergman divergence as loss function to minimize the difference between them. We then design a new network structure with fewer aggregation to alleviate the oversmoothing problem and incorporate graph structure augmentation to improve the representation's stability. Our proposed DMAGE surpasses state-of-the-art methods by a significant margin on three downstream tasks: unsupervised visualization, node clustering, and link prediction across four popular datasets.
Code (1)
Tasks
ClusteringGraph EmbeddingGraph Representation LearningLink PredictionNode ClusteringRepresentation LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding
Representing graph data in a low-dimensional space for subsequent tasks is the purpose of attributed graph embedding. Most existing neural network approaches learn latent representations by minimizing reconstruction erro…
Graph EmbeddingGeoGNN: Quantifying and Mitigating Semantic Drift in Text-Attributed Graphs
Graph neural networks (GNNs) on text--attributed graphs (TAGs) typically encode node texts using pretrained language models (PLMs) and propagate these embeddings through linear neighborhood aggregation. However, the repr…
Graph LearningAnomaly and Change Detection in Graph Streams through Constant-Curvature Manifold Embeddings
Mapping complex input data into suitable lower dimensional manifolds is a common procedure in machine learning. This step is beneficial mainly for two reasons: (1) it reduces the data dimensionality and (2) it provides a…
Anomaly DetectionChange DetectionWalkLM: A Uniform Language Model Fine-tuning Framework for Attributed Graph Embedding
Graphs are widely used to model interconnected entities and improve downstream predictions in various real-world applications. However, real-world graphs nowadays are often associated with complex attributes on multiple …
Fast Attributed Graph Embedding via Density of States
Given a node-attributed graph, how can we efficiently represent it with few numerical features that expressively reflect its topology and attribute information? We propose A-DOGE, for Attributed DOS-based Graph Embedding…
AttributeGraph ClassificationGraph EmbeddingGraph Mining