Sparse and Transformation-Invariant Hierarchical NMF

The hierarchical non-negative matrix factorization (HNMF) is a multilayer generative network for decomposing strictly positive data into strictly positive activations and base vectors in a hierarchical manner. However, the standard hierarchical NMF is not suited for overcomplete representations and does not code efficiently for transformations in the input data. Therefore we extend the standard HNMF by sparsity conditions and transformation-invariance in a natural, straightforward way. The idea is to factorize the input data into several hierarchical layers of activations, base vectors and transformations under sparsity constraints, leading to a less redundant and sparse encoding of the input data.

• Type: Conference
• Year: 2007
• Where: ICANN
• Authors: Sven Rebhan, Julian Eggert, Horst-Michael Groß, Edgar Körner
• Keywords: Hierarchical Non-negative Matrix, ICANN 2007, Input Data, Standard Hierarchical Nmf