Robust semi-supervised nonnegative matrix factorization for image clustering

Siyuan Peng

doi:10.1016/j.patcog.2020.107683

Return

Robust semi-supervised nonnegative matrix factorization for image clustering

2021-03-01

PRE

DOI：10.1016/j.patcog.2020.107683

Original

Original request for help

Save

Abstract

En 中文

Nonnegative matrix factorization (NMF) is a powerful dimension reduction method, and has received increasing attention in various practical applications. However, most traditional NMF based algorithms are sensitive to noisy data, or fail to fully utilize the limited supervised information. In this paper, a novel robust semi-supervised NMF method, namely correntropy based semi-supervised NMF (CSNMF), is proposed to solve these issues. Specifically, CSNMF adopts a correntropy based loss function instead of the squared Euclidean distance (SED) in constrained NMF to suppress the influence of non-Gaussian noise or outliers contaminated in real world data, and simultaneously uses two types of supervised information, i.e., the pointwise and pairwise constraints, to obtain the discriminative data representation. The proposed method is analyzed in terms of convergence, robustness and computational complexity. The relationships between CSNMF and several previous NMF based methods are also discussed. Extensive experimental results show the effectiveness and robustness of CSNMF in image clustering tasks, compared with several state-of-the-art methods. (C) 2020 Elsevier Ltd. All rights reserved.

Keywords:

Nonnegative matrix factorization

Supervised information

Correntropy

Outliers

Image clustering

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.