返回
Class-driven nonnegative matrix factorization with manifold regularization for data clustering
DOI:10.1016/j.neucom.2024.127751.png)
摘要
En 中文
Nonnegative matrix factorization (NMF) is an effective technique to extract the underlying low -dimensional structure of data by utilizing its parts -based representation, which has been widely used in feature extraction and machine learning. However, NMF is an unsupervised learning algorithm without utilizing the discriminative prior information. In this paper, we put forward a new class -driven NMF with manifold regularization (MCDNMF) algorithm, which incorporates both the local manifold regularization and the label information of data into the NMF model. Specifically, MCDNMF not only encodes the local geometrical structure of data space by using the manifold regularization, but also takes the available label information by introducing the class -driven constraint. This class -driven constraint forces the new representations of data points to be more similar within the same class while different between other classes. Therefore, the discriminative abilities of clustering are greatly boosted. Experimental results on several datasets validate the effectiveness of proposed MCDNMF in comparison with the other state-of-the-art methods.
Keyword:
Nonnegative matrix factorization
Manifold regularization
Semi-supervised learning
Class-driven constraint
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Robust nonnegative matrix factorization with structure regularization基于结构正则化的鲁棒非负矩阵分解
NEUROCOMPUTING
IF6.5
Structure constrained nonnegative matrix factorization for pattern clustering and classification
NEUROCOMPUTING
IF6.5

