Symmetrization for Embedding Directed Graphs

Authors

  • Jiankai Sun Ohio State University
  • Srinivasan Parthasarathy Ohio State University

DOI:

https://doi.org/10.1609/aaai.v33i01.330110043

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.

Downloads

Published

2019-07-17

How to Cite

Sun, J., & Parthasarathy, S. (2019). Symmetrization for Embedding Directed Graphs. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 10043-10044. https://doi.org/10.1609/aaai.v33i01.330110043

Issue

Section

Student Abstract Track