IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5571006.html
   My bibliography  Save this article

An Automorphic Distance Metric and Its Application to Node Embedding for Role Mining

Author

Listed:
  • Víctor Martínez
  • Fernando Berzal
  • Juan-Carlos Cubero
  • Atila Bueno

Abstract

Role is a fundamental concept in the analysis of the behavior and function of interacting entities in complex networks. Role discovery is the task of uncovering the hidden roles of nodes within a network. Node roles are commonly defined in terms of equivalence classes. Two nodes have the same role if they fall within the same equivalence class. Automorphic equivalence, where two nodes are equivalent when they can swap their labels to form an isomorphic graph, captures this notion of role. The binary concept of equivalence is too restrictive, and nodes in real-world networks rarely belong to the same equivalence class. Instead, a relaxed definition in terms of similarity or distance is commonly used to compute the degree to which two nodes are equivalent. In this paper, we propose a novel distance metric called automorphic distance, which measures how far two nodes are from being automorphically equivalent. We also study its application to node embedding, showing how our metric can be used to generate role-preserving vector representations of nodes. Our experiments confirm that the proposed automorphic distance metric outperforms a state-of-the-art automorphic equivalence-based metric and different state-of-the-art techniques for the generation of node embeddings in different role-related tasks.

Suggested Citation

  • Víctor Martínez & Fernando Berzal & Juan-Carlos Cubero & Atila Bueno, 2021. "An Automorphic Distance Metric and Its Application to Node Embedding for Role Mining," Complexity, Hindawi, vol. 2021, pages 1-17, October.
  • Handle: RePEc:hin:complx:5571006
    DOI: 10.1155/2021/5571006
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5571006.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5571006.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5571006?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
    ---><---

    More about this item

    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:hin:complx:5571006. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.