Semisupervised Community Preserving Network Embedding with Pairwise Constraints

Complexity 2020:1-14 (2020)
  Copy   BIBTEX

Abstract

Network embedding aims to learn the low-dimensional representations of nodes in networks. It preserves the structure and internal attributes of the networks while representing nodes as low-dimensional dense real-valued vectors. These vectors are used as inputs of machine learning algorithms for network analysis tasks such as node clustering, classification, link prediction, and network visualization. The network embedding algorithms, which considered the community structure, impose a higher level of constraint on the similarity of nodes, and they make the learned node embedding results more discriminative. However, the existing network representation learning algorithms are mostly unsupervised models; the pairwise constraint information, which represents community membership, is not effectively utilized to obtain node embedding results that are more consistent with prior knowledge. This paper proposes a semisupervised modularized nonnegative matrix factorization model, SMNMF, while preserving the community structure for network embedding; the pairwise constraints information are effectively fused with the adjacency matrix and node similarity matrix of the network so that the node representations learned by the model are more interpretable. Experimental results on eight real network datasets show that, comparing with the representative network embedding methods, the node representations learned after incorporating the pairwise constraints can obtain higher accuracy in node clustering task and the results of link prediction, and network visualization tasks indicate that the semisupervised model SMNMF is more discriminative than unsupervised ones.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,466

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Modal and Temporal Argumentation Networks.H. Barringer, D. M. Gabbay & J. Woods - 2012 - Argument and Computation 3 (2-3):203 - 227.
Finding the Trustworthiness Nodes From Signed Social Networks.Xia Wang, Shu Zhang & Hui Li - 2013 - Journal of Intelligent Systems 22 (4):471-485.
Complexity, Networks, and Non-Uniqueness.Alan Baker - 2013 - Foundations of Science 18 (4):687-705.

Analytics

Added to PP
2020-12-22

Downloads
1 (#1,489,356)

6 months
1 (#417,143)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Dong Liu
Tsinghua University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references