{'fraction_non_alphanumeric': 0.016412661195779603, 'fraction_numerical': 0.0, 'mean_word_length': 5.724409448818897, '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}}
Graph regularized projective non-negative matrix factorization for image clustering

For enhancing the cluster accuracy, this paper presents a novel algorithm called Graph regularized Projective Non-negative Matrix Factorization (GPNMF). When original data is factorized in lower dimensional space using NMF, GPNMF preserves the local structure and intrinsic geometry of data, using a PCA-like regularization term to ensure the projection dose not lose too much information available in the original domain. An efficient multiplicative updating procedure was produced, the relation with gradient descent method showed that the updating rules are special case of its. Compared with NMF and its improved algorithms, experiment results on USPS handwrite database and ORL face database have shown that the proposed method achieves better clustering results.