Learning the Hierarchical Parts of Objects by Deep Non-Smooth Nonnegative Matrix Factorization

IEEE Access

卷:6

Guoxu Zhou¹  Shengli Xie¹  Jinshi Yu¹  Andrzej Cichocki² 

[1] Faculty of Automation, Guangdong University of Technology, Guangzhou, China;

[2] Skolkovo Institute of Science and Technology (SKOLTECH), Moscow, Russia;

关键词: Nonnegative matrix factorization (NMF);    nsNMF;    deep nsNMF;    face clustering;    features learning;    sparseness;   

DOI  :  10.1109/ACCESS.2018.2873385

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown