Symmetrization for Embedding Directed Graphs
Abstract
In this paper, we propose to solve the directed graph embedding problem via a two stage approach: in the first stage, the graph is symmetrized in one of several possible ways, and in the second stage, the so-obtained symmetrized graph is embeded using any state-of-the-art (undirected) graph embedding algorithm. Note that it is not the objective of this paper to propose a new (undirected) graph embedding algorithm or discuss the strengths and weaknesses of existing ones; all we are saying is that whichever be the suitable graph embedding algorithm, it will fit in the above proposed symmetrization framework.
Cite
Text
Sun and Parthasarathy. "Symmetrization for Embedding Directed Graphs." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.330110043Markdown
[Sun and Parthasarathy. "Symmetrization for Embedding Directed Graphs." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/sun2019aaai-symmetrization/) doi:10.1609/AAAI.V33I01.330110043BibTeX
@inproceedings{sun2019aaai-symmetrization,
title = {{Symmetrization for Embedding Directed Graphs}},
author = {Sun, Jiankai and Parthasarathy, Srinivasan},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2019},
pages = {10043-10044},
doi = {10.1609/AAAI.V33I01.330110043},
url = {https://mlanthology.org/aaai/2019/sun2019aaai-symmetrization/}
}