en
0.25
0.5
0.75
1.25
1.5
1.75
2
Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators
Published on Sep 06, 20122990 Views
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
Related categories
Chapter list
Directed Graph Embedding: an Algorithm based on Continuous Limits of Laplacian-type Operators00:00
Model Schematic00:20
Articial Data02:14
Main Contributions03:03