Journal
IEEE ACCESS
Volume 6, Issue -, Pages 58096-58105Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2018.2873385
Keywords
Nonnegative matrix factorization (NMF); nsNMF; deep nsNMF; face clustering; features learning; sparseness
Categories
Funding
- National Nature Science Foundation of China (NSFC) [61673124]
- Ministry of Education and Science of the Russian Federation [14.756.31.0001]
- Polish National Science Center [2016/20/W/N24/00354]
Ask authors/readers for more resources
Nonsmooth nonnegative matrix factorization (nsNMF) is capable of producing more localized, less overlapped feature representations than other variants of NMF while keeping satisfactory fit to data. However, nsNMF as well as other existing NMF methods are incompetent to learn hierarchical features of complex data due to its shallow structure. To fill this gap, we propose a deep nsNMF method coined by the fact that it possesses a deeper architecture compared with standard nsNMF. The deep nsNMF not only gives part-based features due to the nonnegativity constraints but also creates higher level, more abstract features by combing lower level ones. The in-depth description of how deep architecture can help to efficiently discover abstract features in dnsNMF is presented, suggesting that the proposed model inherits the major advantages from both deep learning and NMF. Extensive experiments demonstrate the standout performance of the proposed method in clustering analysis.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available