资源分类
》 资源 》论文》LOW- DIMENSIONAL STATISTICAL MANIFOLD EMBED -DING OF DIRECTED GRAPHS

LOW- DIMENSIONAL STATISTICAL MANIFOLD EMBED -DING OF DIRECTED GRAPHS

2020-01-02 | |  67 |   40 |   0

Abstract

We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density function over a measurable space. Furthermore, we analyze the connection between the geometrical properties of such embedding and their efficient learning procedure. Extensive experiments show that our proposed embedding is better in preserving the global geodesic information of graphs, as well as outperforming existing embedding models on directed graphs in a variety of evaluation metrics, in an unsupervised setting.

上一篇：PROJECTION BASED CONSTRAINED POLICY OPTI -MIZATION

下一篇：ABDUCTIVE COMMONSENSE REASONING

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...