IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/97310.html
   My bibliography  Save this paper

Efficient Algorithms for Constructing Multiplex Networks Embedding

Author

Listed:
  • Zolnikov, Pavel
  • Zubov, Maxim
  • Nikitinsky, Nikita
  • Makarov, Ilya

Abstract

Network embedding has become a very promising techniquein analysis of complex networks. It is a method to project nodes of anetwork into a low-dimensional vector space while retaining the structureof the network based on vector similarity. There are many methods ofnetwork embedding developed for traditional single layer networks. Onthe other hand, multilayer networks can provide more information aboutrelationships between nodes. In this paper, we present our random walkbased multilayer network embedding and compare it with single layerand multilayer network embeddings. For this purpose, we used severalclassic datasets usually used in network embedding experiments and alsocollected our own dataset of papers and authors indexed in Scopus.

Suggested Citation

  • Zolnikov, Pavel & Zubov, Maxim & Nikitinsky, Nikita & Makarov, Ilya, 2019. "Efficient Algorithms for Constructing Multiplex Networks Embedding," MPRA Paper 97310, University Library of Munich, Germany, revised 23 Sep 2019.
    • Handle: RePEc:pra:mprapa:97310
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/97310/1/paper5.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Network embedding; Multi-layer network; Machine learning on graphs;
    All these keywords.

    JEL classification:

    • C45 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Neural Networks and Related Topics
    • I20 - Health, Education, and Welfare - - Education - - - General

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:pra:mprapa:97310. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    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.