.png){kind=icon}
返回
Network Embedding Using Semi-Supervised Kernel Nonnegative Matrix Factorization
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2927496.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Network embedding, aiming to learn low-dimensional representations of nodes in networks, is very useful for many vector-based machine learning algorithms and has become a hot research topic in network analysis. Although many methods for network embedding have been proposed before, most of them are unsupervised, which ignores the role of prior information available in the network. In this paper, we propose a novel method for network embedding using semi-supervised kernel nonnegative matrix factorization (SSKNMF), which can incorporate prior information and thus to learn more useful features from the network through introducing kernel methodology. Besides, it can improve robustness against noises by using the objective function based on L-2,L-1 norm. Efficient iterative update rules are derived to resolve the network embedding model using the SSKNMF, and the convergence of these rules are strictly proved from the perspective of mathematics. The results from extensive experiments on several real-world networks show that our proposed algorithm is effective and has better performance than the existing representative methods.
Keyword:
Kernel method
network analysis
network embedding
nonnegative matrix factorization
semi-supervised learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.7W
机构
引用论文
.png){kind=icon}
Insurance activity and economic performance: Fresh evidence from asymmetric panel causality testsOAAI
OAAI分享收藏Passive signal propagation and membrane properties in median photoreceptors of the giant barnacleOAAI
OAAI分享收藏A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications图嵌入的综合调查: 问题，技术和应用OAAI
OAAI分享收藏
查看更多内容