Next Article in Journal
Tsallis Entropy Theory for Modeling in Water Engineering: A Review
Previous Article in Journal
Magnetic Engine for the Single-Particle Landau Problem
Article Menu
Issue 12 (December) cover image

Export Article

Open AccessArticle

Group Sparsity and Graph Regularized Semi-Nonnegative Matrix Factorization with Discriminability for Data Representation

1,2 and 1,*
1
College of Information and Technology, Northwest University of China, Xi’an 710127, China
2
Department of Information Management, Hunan University of Finance and Economics, Chang Sha 410205, China
*
Author to whom correspondence should be addressed.
Entropy 2017, 19(12), 627; https://doi.org/10.3390/e19120627
Received: 14 September 2017 / Revised: 6 November 2017 / Accepted: 13 November 2017 / Published: 27 November 2017
(This article belongs to the Section Information Theory, Probability and Statistics)
  |  
PDF [829 KB, uploaded 27 November 2017]
  |  

Abstract

Semi-Nonnegative Matrix Factorization (Semi-NMF), as a variant of NMF, inherits the merit of parts-based representation of NMF and possesses the ability to process mixed sign data, which has attracted extensive attention. However, standard Semi-NMF still suffers from the following limitations. First of all, Semi-NMF fits data in a Euclidean space, which ignores the geometrical structure in the data. What’s more, Semi-NMF does not incorporate the discriminative information in the learned subspace. Last but not least, the learned basis in Semi-NMF is unnecessarily part based because there are no explicit constraints to ensure that the representation is part based. To settle these issues, in this paper, we propose a novel Semi-NMF algorithm, called Group sparsity and Graph regularized Semi-Nonnegative Matrix Factorization with Discriminability (GGSemi-NMFD) to overcome the aforementioned problems. GGSemi-NMFD adds the graph regularization term in Semi-NMF, which can well preserve the local geometrical information of the data space. To obtain the discriminative information, approximation orthogonal constraints are added in the learned subspace. In addition, 21 norm constraints are adopted for the basis matrix, which can encourage the basis matrix to be row sparse. Experimental results in six datasets demonstrate the effectiveness of the proposed algorithms. View Full-Text
Keywords: non-negative matrix factorization; data representation; clustering non-negative matrix factorization; data representation; clustering
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Luo, P.; Peng, J. Group Sparsity and Graph Regularized Semi-Nonnegative Matrix Factorization with Discriminability for Data Representation. Entropy 2017, 19, 627.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top