Semi-supervised multi-view clustering by label relaxation based non-negative matrix factorization

Semi-supervised multi-view clustering in the subspace has attracted sustained attention. The existing methods often project the samples with the same label into the same point in the low dimensional space. This hard constraint-based method magnifies the dimension reduction error, restricting the sub...

Full description

Saved in:
Bibliographic Details
Published in:The Visual computer 2023-04, Vol.39 (4), p.1409-1422
Main Authors: Yang, Zuyuan, Zhang, Huimin, Liang, Naiyao, Li, Zhenni, Sun, Weijun
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Clustering
Computer Graphics
Computer Science
Correlation coefficients
Error reduction
Factorization
Image Processing and Computer Vision
Iterative methods
Labels
Learning
Methods
Original Article
Performance indices
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Semi-supervised multi-view clustering in the subspace has attracted sustained attention. The existing methods often project the samples with the same label into the same point in the low dimensional space. This hard constraint-based method magnifies the dimension reduction error, restricting the subsequent clustering performance. To relax the labeled data during projection, we propose a novel method called label relaxation-based semi-supervised non-negative matrix factorization (LRSNMF). In our method, we first employ the Spearman correlation coefficient to measure the similarity between samples. Based on this, we design a new relaxed non-negative label matrix for better subspace learning, instead of the binary matrix. Also, we derive an updated algorithm based on an alternative iteration rule to solve the proposed model. Finally, the experimental results on three real-world datasets (i.e., MSRC, ORL1, and ORL2) with six evaluation indexes (i.e., accuracy, NMI, purity, F-score, precision, and recall) show the advantages of our LRSNMF, with comparison to the state-of-the-art methods.
ISSN:0178-2789
1432-2315
DOI:10.1007/s00371-022-02419-z