arXiv Analytics

Sign in

arXiv:1707.05926 [cs.LG]AbstractReferencesReviewsResources

Equivalence between LINE and Matrix Factorization

Qiao Wang, Zheng Wang, Xiaojun Ye

Published 2017-07-19Version 1

LINE [1], as an efficient network embedding method, has shown its effectiveness in dealing with large-scale undirected, directed, and/or weighted networks. Particularly, it proposes to preserve both the local structure (represented by First-order Proximity) and global structure (represented by Second-order Proximity) of the network. In this study, we prove that LINE with these two proximities (LINE(1st) and LINE(2nd)) are actually factoring two different matrices separately. Specifically, LINE(1st) is factoring a matrix M (1), whose entries are the doubled Pointwise Mutual Information (PMI) of vertex pairs in undirected networks, shifted by a constant. LINE(2nd) is factoring a matrix M (2), whose entries are the PMI of vertex and context pairs in directed networks, shifted by a constant. We hope this finding would provide a basis for further extensions and generalizations of LINE.

Related articles: Most relevant | Search more
arXiv:2310.12688 [cs.LG] (Published 2023-10-19)
Compression of Recurrent Neural Networks using Matrix Factorization
arXiv:1203.4523 [cs.LG] (Published 2012-03-20, updated 2012-09-11)
On the Equivalence between Herding and Conditional Gradient Algorithms
arXiv:1512.04483 [cs.LG] (Published 2015-12-14)
Dropout Training of Matrix Factorization and Autoencoder for Link Prediction in Sparse Graphs