IDEAS home Printed from https://ideas.repec.org/a/sae/joudef/v18y2021i3p239-246.html
   My bibliography  Save this article

Joint sparsity-biased variational graph autoencoders

Author

Listed:
  • Lane Lawley
  • Will Frey
  • Patrick Mullen
  • Alexander D Wissner-Gross

Abstract

To bring the full benefits of machine learning to defense modeling and simulation, it is essential to first learn useful representations for sparse graphs consisting of both key entities (vertices) and their relationships (edges). Here, we present a new model, the Joint Sparsity-Biased Variational Graph AutoEncoder (JSBVGAE), capable of learning embedded representations of nodes from which both sparse network topologies and node features can be jointly and accurately reconstructed. We show that our model outperforms the previous state of the art on standard link-prediction and node-classification tasks, and achieves significantly higher whole-network reconstruction accuracy, while reducing the number of trained parameters.

Suggested Citation

  • Lane Lawley & Will Frey & Patrick Mullen & Alexander D Wissner-Gross, 2021. "Joint sparsity-biased variational graph autoencoders," The Journal of Defense Modeling and Simulation, , vol. 18(3), pages 239-246, July.
    • Handle: RePEc:sae:joudef:v:18:y:2021:i:3:p:239-246
    DOI: 10.1177/1548512921996828
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1548512921996828
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1548512921996828?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:joudef:v:18:y:2021:i:3:p:239-246. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.