A HYBRID MEMBERSHIP LATENT DISTANCE MODEL FOR UNSIGNED AND SIGNED INTEGER WEIGHTED NETWORKS

Nikolaos Nakis (), Abdulkadir Çelikkanat () and Morten Mã˜rup
Additional contact information
Nikolaos Nakis: Department of Applied Mathematics and Computer Science, Technical University of Denmark, Anker Engelunds Vej 101, Kongens Lyngby 2800, Denmark
Abdulkadir Çelikkanat: Department of Applied Mathematics and Computer Science, Technical University of Denmark, Anker Engelunds Vej 101, Kongens Lyngby 2800, Denmark
Morten Mã˜rup: Department of Applied Mathematics and Computer Science, Technical University of Denmark, Anker Engelunds Vej 101, Kongens Lyngby 2800, Denmark

Advances in Complex Systems (ACS), 2023, vol. 26, issue 03, 1-30

Abstract: Graph representation learning (GRL) has become a prominent tool for furthering the understanding of complex networks providing tools for network embedding, link prediction, and node classification. In this paper, we propose the Hybrid Membership-Latent Distance Model (HM-LDM) by exploring how a Latent Distance Model (LDM) can be constrained to a latent simplex. By controlling the edge lengths of the corners of the simplex, the volume of the latent space can be systematically controlled. Thereby communities are revealed as the space becomes more constrained, with hard memberships being recovered as the simplex volume goes to zero. We further explore a recent likelihood formulation for signed networks utilizing the Skellam distribution to account for signed weighted networks and extend the HM-LDM to the signed Hybrid Membership-Latent Distance Model (sHM-LDM). Importantly, the induced likelihood function explicitly attracts nodes with positive links and deters nodes having negative interactions. We demonstrate the utility of HM-LDM and sHM-LDM on several real networks. We find that the procedures successfully identify prominent distinct structures, as well as how nodes relate to the extracted aspects providing favorable performances in terms of link prediction when compared to prominent baselines. Furthermore, the learned soft memberships enable easily interpretable network visualizations highlighting distinct patterns.

Keywords: Signed networks; community detection; non-negative matrix factorization; graph representation learning; latent space modeling (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219525923400027
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:acsxxx:v:26:y:2023:i:03:n:s0219525923400027

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0219525923400027

Access Statistics for this article

Advances in Complex Systems (ACS) is currently edited by Frank Schweitzer

More articles in Advances in Complex Systems (ACS) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().