Sparse Deep Nonnegative Matrix Factorization

doi:10.26599/BDMA.2019.9020020

Sparse Deep Nonnegative Matrix Factorization

2020-03-01

20

OA

AI

DOI：10.26599/BDMA.2019.9020020

原文链接

查看原文

摘要

En 中文

Nonnegative Matrix Factorization (NMF) is a powerful technique to perform dimension reduction and pattern recognition through single-layer data representation learning. However, deep learning networks, with their carefully designed hierarchical structure, can combine hidden features to form more representative features for pattern recognition. In this paper, we proposed sparse deep NMF models to analyze complex data for more accurate classification and better feature interpretation. Such models are designed to learn localized features or generate more discriminative representations for samples in distinct classes by imposing L-1-norm penalty on the columns of certain factors. By extending a one-layer model into a multilayer model with sparsity, we provided a hierarchical way to analyze big data and intuitively extract hidden features due to nonnegativity. We adopted the Nesterov's accelerated gradient algorithm to accelerate the computing process. We also analyzed the computing complexity of our frameworks to demonstrate their efficiency. To improve the performance of dealing with linearly inseparable data, we also considered to incorporate popular nonlinear functions into these frameworks and explored their performance. We applied our models using two benchmarking image datasets, and the results showed that our models can achieve competitive or better classification performance and produce intuitive interpretations compared with the typical NMF and competing multilayer models.

Keyword:

sparse Nonnegative Matrix Factorization (NMF)

deep learning

Nesterov's accelerated gradient algorithm

Sparse Deep Nonnegative Matrix Factorization

摘要

AI总结

期刊

机构

引用论文