Back to Search Start Over

Associative Learning for Network Embedding

Authors :
Liang, Yuchen
Krotov, Dmitry
Zaki, Mohammed J.
Publication Year :
2022

Abstract

The network embedding task is to represent the node in the network as a low-dimensional vector while incorporating the topological and structural information. Most existing approaches solve this problem by factorizing a proximity matrix, either directly or implicitly. In this work, we introduce a network embedding method from a new perspective, which leverages Modern Hopfield Networks (MHN) for associative learning. Our network learns associations between the content of each node and that node's neighbors. These associations serve as memories in the MHN. The recurrent dynamics of the network make it possible to recover the masked node, given that node's neighbors. Our proposed method is evaluated on different downstream tasks such as node classification and linkage prediction. The results show competitive performance compared to the common matrix factorization techniques and deep learning based methods.<br />Comment: Accepted at the Eighth International Workshop on Deep Learning on Graphs: Methods and Applications (DLG-KDD 2022), Washington DC

Details

Database :
arXiv
Publication Type :
Report
Accession number :
edsarx.2208.14376
Document Type :
Working Paper