{'fraction_non_alphanumeric': 0.021169354838709676, 'fraction_numerical': 0.0, 'mean_word_length': 5.576158940397351, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Novel Enhanced Nonnegative Feature Extraction Approach

Nonnegative matrix factorization (NMF) is a promising approach for image-data representation and classification under the nonnegativity constraint. However, the traditional NMF does not exploit the data-label information and its performance will be degraded in classification tasks. To overcome the flaw of NMF, this paper proposes a novel enhanced nonnegative matrix factorization (ENMF) method for learning powerful discriminative feature. The basic idea is that the training data from the same class are forced to embed into their own feature subspaces, where these subspaces are mutually orthogonal. The ENMF update rule is obtained by means of auxiliary function technique and Cardano's formula. We prove and analyze the convergence of the proposed ENMF algorithm theoretically and empirically. Experimental results on face recognition show that the proposed method outperforms the existing state-of-the-art NMF-based algorithms.