非负矩阵分解
聚类分析
超图
离群值
特征选择
模式识别(心理学)
计算机科学
稳健性(进化)
人工智能
欧几里德距离
正规化(语言学)
矩阵分解
数学
数据挖掘
特征向量
生物化学
物理
化学
离散数学
量子力学
基因
作者
Na Yu,Ming-Juan Wu,Jin‐Xing Liu,Chun-Hou Zheng,Yong Xu
出处
期刊:IEEE transactions on cybernetics
[Institute of Electrical and Electronics Engineers]
日期:2020-06-30
卷期号:51 (8): 3952-3963
被引量:89
标识
DOI:10.1109/tcyb.2020.3000799
摘要
Non-negative matrix factorization (NMF) has become one of the most powerful methods for clustering and feature selection. However, the performance of the traditional NMF method severely degrades when the data contain noises and outliers or the manifold structure of the data is not taken into account. In this article, a novel method called correntropy-based hypergraph regularized NMF (CHNMF) is proposed to solve the above problem. Specifically, we use the correntropy instead of the Euclidean norm in the loss term of CHNMF, which will improve the robustness of the algorithm. And the hypergraph regularization term is also applied to the objective function, which can explore the high-order geometric information in more sample points. Then, the half-quadratic (HQ) optimization technique is adopted to solve the complex optimization problem of CHNMF. Finally, extensive experimental results on multi-cancer integrated data indicate that the proposed CHNMF method is superior to other state-of-the-art methods for clustering and feature selection.
科研通智能强力驱动
Strongly Powered by AbleSci AI