Preserving Node Distinctness in Graph Autoencoders via Similarity Distillation.
Ge ChenYulan HuSheng OuyangYong LiuCuicui LuoPublished in: CoRR (2024)
Keyphrases
- graph structure
- directed graph
- undirected graph
- similarity measure
- similarity graph
- denoising
- graph representation
- inexact graph matching
- random walk
- root node
- normalized cut
- graph theoretic
- nodes of a graph
- weighted graph
- bipartite graph
- graph model
- edge weights
- similarity function
- similarity measurement
- edit distance
- distance measure
- structured data
- similarity scores
- tree structure
- graph partitioning
- directed acyclic graph
- graph theory
- euclidean distance
- graph matching
- strongly connected
- overlapping communities
- probabilistic model
- neural network