{'fraction_non_alphanumeric': 0.01650943396226415, 'fraction_numerical': 0.0, 'mean_word_length': 5.431818181818182, '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}}
Incremental locality preserving nonnegative matrix factorization

Recently nonnegative matrix factorization (NMF) has become a popular dimension reduction method and it has been successfully applied to image processing and pattern recognition. In this paper, we propose an incremental locality preserving nonnegative matrix factorization (ILPNMF) method, which is aimed to discover the manifold structure embedded in high-dimensional space that deals well with large scale data. By assuming that the newly added samples do not change the encoding vectors of old samples, we present a cost function for online learning. Then we use projected gradient method to solve the update rule of the cost function. Experimental results show that ILPNMF provides a better parts-based representation compared with INMF and it is faster than the batch one LPNMF.