Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix Factorization
Network embedding, as an effective method of learning the low-dimensional representations of nodes, has been widely applied to various complex network analysis tasks, such as node classification, community detection, link prediction and evolution analysis. The existing embedding methods usually focu...
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9296805/ |
id |
doaj-b410b70b73ad48d19de42b268dceecdc |
---|---|
record_format |
Article |
spelling |
doaj-b410b70b73ad48d19de42b268dceecdc2021-03-30T04:43:24ZengIEEEIEEE Access2169-35362020-01-01822596722598010.1109/ACCESS.2020.30455329296805Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix FactorizationQin Tian0https://orcid.org/0000-0003-0268-8868Lin Pan1https://orcid.org/0000-0001-5074-7661Xuan Guo2Xiaoming Li3https://orcid.org/0000-0002-9956-1793Wei Yu4https://orcid.org/0000-0003-3459-3695Faming Li5School of Marine Science and Technology, Tianjin University, Tianjin, ChinaSchool of Marine Science and Technology, Tianjin University, Tianjin, ChinaCollege of Intelligence and Computing, Tianjin University, Tianjin, ChinaSchool of International Business, Zhejiang Yuexiu University, Shaoxing, ChinaSchool of International Business, Zhejiang Yuexiu University, Shaoxing, ChinaResearch Institute for Chemical Defense, Beijing, ChinaNetwork embedding, as an effective method of learning the low-dimensional representations of nodes, has been widely applied to various complex network analysis tasks, such as node classification, community detection, link prediction and evolution analysis. The existing embedding methods usually focus on the local structure of the network by capturing community structure, first-order or second-order proximity, etc. Some methods have been proposed to model the high-order proximity of networks to capture more effective information. However, they are incapable of preserving the similarity among nodes that are not very close to each other in network but have similar structures. For instance, the nodes with similar local topology structure should be similar in embedding space even if they are not in the same community. Herein, we regard these structure characteristics as the high-order features, which reveals that the structure similarity between nodes is spatially unrelated. In light of above the limitations of existing methods, we construct the high-order feature matrix for mutually reinforcing the embedding which preserves the local structure. To integrate these features effectively, we propose LHO-NMF, which fuses the high-order features into non-negative matrix factorization framework while capturing the local structure. The proposed LHO-NMF could effectively learn the node representations via preserving the local structure and high-order feature information. In specific, the high-order features are learned based on random walk algorithm. The experimental results show that the proposed LHO-NMF method is very effective and outperforms other state-of-the-art methods among multiple downstream tasks.https://ieeexplore.ieee.org/document/9296805/Network embeddinglocal structurehigh-order featurenon-negative matrix factorization |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Qin Tian Lin Pan Xuan Guo Xiaoming Li Wei Yu Faming Li |
spellingShingle |
Qin Tian Lin Pan Xuan Guo Xiaoming Li Wei Yu Faming Li Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix Factorization IEEE Access Network embedding local structure high-order feature non-negative matrix factorization |
author_facet |
Qin Tian Lin Pan Xuan Guo Xiaoming Li Wei Yu Faming Li |
author_sort |
Qin Tian |
title |
Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix Factorization |
title_short |
Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix Factorization |
title_full |
Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix Factorization |
title_fullStr |
Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix Factorization |
title_full_unstemmed |
Local Structure and High-Order Feature Preserved Network Embedding Based on Non-Negative Matrix Factorization |
title_sort |
local structure and high-order feature preserved network embedding based on non-negative matrix factorization |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2020-01-01 |
description |
Network embedding, as an effective method of learning the low-dimensional representations of nodes, has been widely applied to various complex network analysis tasks, such as node classification, community detection, link prediction and evolution analysis. The existing embedding methods usually focus on the local structure of the network by capturing community structure, first-order or second-order proximity, etc. Some methods have been proposed to model the high-order proximity of networks to capture more effective information. However, they are incapable of preserving the similarity among nodes that are not very close to each other in network but have similar structures. For instance, the nodes with similar local topology structure should be similar in embedding space even if they are not in the same community. Herein, we regard these structure characteristics as the high-order features, which reveals that the structure similarity between nodes is spatially unrelated. In light of above the limitations of existing methods, we construct the high-order feature matrix for mutually reinforcing the embedding which preserves the local structure. To integrate these features effectively, we propose LHO-NMF, which fuses the high-order features into non-negative matrix factorization framework while capturing the local structure. The proposed LHO-NMF could effectively learn the node representations via preserving the local structure and high-order feature information. In specific, the high-order features are learned based on random walk algorithm. The experimental results show that the proposed LHO-NMF method is very effective and outperforms other state-of-the-art methods among multiple downstream tasks. |
topic |
Network embedding local structure high-order feature non-negative matrix factorization |
url |
https://ieeexplore.ieee.org/document/9296805/ |
work_keys_str_mv |
AT qintian localstructureandhighorderfeaturepreservednetworkembeddingbasedonnonnegativematrixfactorization AT linpan localstructureandhighorderfeaturepreservednetworkembeddingbasedonnonnegativematrixfactorization AT xuanguo localstructureandhighorderfeaturepreservednetworkembeddingbasedonnonnegativematrixfactorization AT xiaomingli localstructureandhighorderfeaturepreservednetworkembeddingbasedonnonnegativematrixfactorization AT weiyu localstructureandhighorderfeaturepreservednetworkembeddingbasedonnonnegativematrixfactorization AT famingli localstructureandhighorderfeaturepreservednetworkembeddingbasedonnonnegativematrixfactorization |
_version_ |
1724181363506020352 |