Network Embedding Using Deep Robust Nonnegative Matrix Factorization

Chaobo He, Hai Liu, Yong Tang, Xiang Fei, Hanchao Li, Shuangyin Liu

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
10 Downloads (Pure)


As an effective technique to learn low-dimensional node features in complicated network environment, network embedding has become a promising research direction in the field of network analysis. Due to the virtues of better interpretability and flexibility, matrix factorization based methods for network embedding have received increasing attentions. However, most of them are inadequate to learn more complicated hierarchical features hidden in complex networks because of their mechanisms of single-layer factorization structure. Besides, their original feature matrices used for factorization and their robustness against noises also need to be further improved. To solve these problems, we propose a novel network embedding method named DRNMF (deep robust nonnegative matrix factorization), which is formed by multi-layer NMF learning structure. Meanwhile, DRNMF employs the combination of high-order proximity matrices of the network as the original feature matrix for the factorization. To improve the robustness against noises, we use l2,1 norm to devise the objective function for the DRNMF network embedding model. Effective iterative update rules are derived to resolve the model, and the convergence of these rules is strictly proved. Moreover, we introduce a pre-training strategy to improve the efficiency of convergence. Extensive experiments on several benchmarks of complex networks demonstrate that our proposed method DRNMF is effective and has better performance than the state-of-the-art matrix factorization based methods for network embedding.
Original languageEnglish
Article number9086036
Pages (from-to)85441-85453
Number of pages13
JournalIEEE Access
Publication statusPublished - 4 May 2020

Bibliographical note

Open Access Under a Creative Commons License

Copyright © and Moral Rights are retained by the author(s) and/ or other copyright owners. A copy can be downloaded for personal non-commercial research or study, without prior permission or charge. This item cannot be reproduced or quoted extensively from without first obtaining permission in writing from the copyright holder(s). The content must not be changed in any way or sold commercially in any format or medium without the formal permission of the copyright holders.


  • network embedding
  • deep nonnegative matrix factorization
  • network analysis
  • Complex networks


Dive into the research topics of 'Network Embedding Using Deep Robust Nonnegative Matrix Factorization'. Together they form a unique fingerprint.

Cite this