资源分类
》 资源 》论文》Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators

Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators

2020-01-08 | |  62 |   50 |   0

Abstract

This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model the observed graph as a sample from a manifold endowed with a vector field, and we design an algorithm that separates and recovers the features of this process: the geometry of the manifold, the data density and the vector field. The algorithm is motivated by our analysis of Laplacian-type operators and their continuous limit as generators of diffusions on a manifold. We illustrate the recovery algorithm on both artificially constructed and real data.

上一篇：Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning

下一篇：Statistical Tests for Optimization Efficiency

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...