Graph Diffusion-Embedding Networks
We present a novel graph diffusion-embedding networks (GDEN) for graph structured data. GDEN is motivated by our closed-form formulation on regularized feature diffusion on graph. GDEN integrates both regularized feature diffusion and low-dimensional embedding simultaneously in a unified network model. Moreover, based on GDEN, we can naturally deal with structured data with multiple graph structures. Experiments on semi-supervised learning tasks on several benchmark datasets demonstrate the better performance of the proposed GDEN when comparing with the traditional GCN models.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Data Representation and Learning With Graph Diffusion-Embedding Networks
Recently, graph convolutional neural networks have been widely studied for graph-structured data representation and learning. In this paper, we present Graph Diffusion-Embedding networks (GDENs), a new model for graph-st…
Digraphwave: Scalable Extraction of Structural Node Embeddings via Diffusion on Directed Graphs
Structural node embeddings, vectors capturing local connectivity information for each node in a graph, have many applications in data mining and machine learning, e.g., network alignment and node classification, clusteri…
Anomaly DetectionNode ClassificationNeumann eigenmaps for landmark embedding
We present Neumann eigenmaps (NeuMaps), a novel approach for enhancing the standard diffusion map embedding using landmarks, i.e distinguished samples within the dataset. By interpreting these landmarks as a subgraph of …
Fast Sequence-Based Embedding with Diffusion Graphs
A graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes. Vertex sequence-based embedding procedures use features extrac…
ClusteringCommunity DetectionComputational EfficiencyGraph Embedding+1Fast Sequence Based Embedding with Diffusion Graphs
A graph embedding is a representation of the vertices of a graph in a low dimensional space, which approximately preserves proper-ties such as distances between nodes. Vertex sequence based embedding procedures use fea…
ClusteringCommunity DetectionComputational EfficiencyGraph Embedding+2