pith. sign in

arxiv: 1810.00797 · v1 · pith:ANXQYVTInew · submitted 2018-10-01 · 💻 cs.CV

Graph Diffusion-Embedding Networks

classification 💻 cs.CV
keywords gdengraphdatadiffusiondiffusion-embeddingfeaturenetworksregularized
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.