Multi-View Attributed Network Embedding Using Manifold Regularization Preserving Non-Negative Matrix Factorization

被引:3
作者
Yuan, Weiwei [1 ,2 ]
Li, Xiang [1 ,2 ]
Guan, Donghai [1 ,2 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Comp Sci & Technol, Nanjing 211106, Peoples R China
[2] Collaborat Innovat Ctr Novel Software Technol & I, Nanjing 210000, Peoples R China
基金
中国国家自然科学基金;
关键词
Manifold regularization; non-negative matrix factorization; multi-view; attributed network; network embedding;
D O I
10.1109/TKDE.2023.3325461
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Attributed network has more network information, so more and more attention is paid to the embedding of attributed network. A few existing works have considered the node attributes plays a crucial role in the quality of network embedding. They use the non-negative matrix factorization (NMF) method to mine the network information of network structure and node attributes respectively. Considering the reconstruction error of NMF method, the original network information will be lost when the final network embedding is generated. In this paper, we propose a novel multi-view attributed network embedding model with manifold regularization (Mane). The manifold regularization is added to the model to better reflect the Riemann geometry structure of the network in the feature space to enhance the information. And the problem of missing information of NMF is solved. Our approach uses the NMF to get the non-negative coefficient matrix corresponding to network structure and node attributes. Then cooperative regularization and manifold regularization is added to obtain more information in the final network embedding. The model proposed in this paper has been verified by experiments on several real data sets. The result shows that the model is superior to the state-of-the-art algorithm in node classification task.
引用
收藏
页码:2563 / 2571
页数:9
相关论文
共 32 条
[1]  
Bandyopadhyay S, 2018, Arxiv, DOI arXiv:1804.05313
[2]  
Belkin M, 2002, ADV NEUR IN, V14, P585
[3]  
Bhagat S, 2011, SOCIAL NETWORK DATA ANALYTICS, P115
[4]  
Cao SS, 2016, AAAI CONF ARTIF INTE, P1145
[5]  
Cao SS., 2015, P 24 ACM INT C INF K, P891, DOI DOI 10.1145/2806416.2806512
[6]   A Survey on Network Embedding [J].
Cui, Peng ;
Wang, Xiao ;
Pei, Jian ;
Zhu, Wenwu .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (05) :833-852
[7]   Computing the distribution of quadratic forms: Further comparisons between the Liu-Tang-Zhang approximation and exact methods [J].
Duchesne, Pierre ;
De Micheaux, Pierre Lafaye .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2010, 54 (04) :858-862
[8]  
Gao HC, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3364
[9]   Graph embedding techniques, applications, and performance: A survey [J].
Goyal, Palash ;
Ferrara, Emilio .
KNOWLEDGE-BASED SYSTEMS, 2018, 151 :78-94
[10]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864