.png){kind=icon}
.png){kind=icon}
Return
DMGAE: An interpretable representation learning method for directed scale-free networks based on autoencoder and masking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2024.104007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Although existing graph self-supervised learning approaches have paid attention to the directed nature of networks, they have often overlooked the ubiquitous scale-free attributes. This oversight has resulted in a theoretical gap in understanding graph self-supervised learning from the perspective of network structure. In this paper, we study the degree distribution characteristics of source and target nodes in directed scale-free networks, encompassing node and edge dimensions. Our theoretical analysis reveals the relationship between the average degree of nodes and their average in-degree and out-degree, which is instrumental in discerning positive and negative edges, as well as edge directionality. Here positive edges are the ones that exists in the original graph, and negative edges are the ones that not exists in the original graph. Furthermore, we uncover negative edges connecting to central nodes and positive edges to peripheral nodes to be less predictable. Based on these crucial theoretical insights, we propose DMGAE (Directed Masked Graph Autoencoder), a novel representation learning method for directed scale-free networks that offers interpretability. The DMGAE method employs a weighted graph based on edges to replace the original graph structure. It integrates a masking approach based on the weight of the edges. Additionally, it incorporates an adaptive negative sampling method, edge decoder and a degree decoder based on the difference between the in- degree and out-degree of the node. This enhances the model's capability to learn edges and discern their directions. Empirical studies on extensive real-world network data show that, compared to the state-of-the-art methods, DMGAE not only generally has superior learning performance on directed networks, but also performs exceedingly well on undirected networks.
Keywords:
Complex networks
Representation learning
Directed graph
Scale-free networks
Masking
Autoencoder
Journal
I
IF:
6.9
Papers:
5.2K
Citations:
1.4W