Next Article in Journal
Material Optimization for a High Power Thermoelectric Generator in Wearable Applications
Previous Article in Journal
A Comparative Study of Clustering Analysis Method for Driver’s Steering Intention Classification and Identification under Different Typical Conditions
Article Menu
Issue 10 (October) cover image

Export Article

Open AccessArticle
Appl. Sci. 2017, 7(10), 1013; doi:10.3390/app7101013

2,1 Norm and Hessian Regularized Non-Negative Matrix Factorization with Discriminability for Data Representation

1
College of Information and Technology, Northwest University of China, Xi’an 710127, China
2
Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA
*
Author to whom correspondence should be addressed.
Received: 4 September 2017 / Revised: 26 September 2017 / Accepted: 26 September 2017 / Published: 30 September 2017
(This article belongs to the Section Computer Science and Electrical Engineering)
View Full-Text   |   Download PDF [606 KB, uploaded 9 October 2017]   |  

Abstract

Matrix factorization based methods have widely been used in data representation. Among them, Non-negative Matrix Factorization (NMF) is a promising technique owing to its psychological and physiological interpretation of spontaneously occurring data. On one hand, although traditional Laplacian regularization can enhance the performance of NMF, it still suffers from the problem of its weak extrapolating ability. On the other hand, standard NMF disregards the discriminative information hidden in the data and cannot guarantee the sparsity of the factor matrices. In this paper, a novel algorithm called 2 , 1 norm and Hessian Regularized Non-negative Matrix Factorization with Discriminability ( 2 , 1 HNMFD), is developed to overcome the aforementioned problems. In 2 , 1 HNMFD, Hessian regularization is introduced in the framework of NMF to capture the intrinsic manifold structure of the data. 2 , 1 norm constraints and approximation orthogonal constraints are added to assure the group sparsity of encoding matrix and characterize the discriminative information of the data simultaneously. To solve the objective function, an efficient optimization scheme is developed to settle it. Our experimental results on five benchmark data sets have demonstrated that 2 , 1 HNMFD can learn better data representation and provide better clustering results. View Full-Text
Keywords: non-negative matrix factorization; Hessian regularization; Discriminability; clustering non-negative matrix factorization; Hessian regularization; Discriminability; 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 alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Luo, P.; Peng, J.; Fan, J. ℓ2,1 Norm and Hessian Regularized Non-Negative Matrix Factorization with Discriminability for Data Representation. Appl. Sci. 2017, 7, 1013.

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]
Appl. Sci. EISSN 2076-3417 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top