{'fraction_non_alphanumeric': 0.021505376344086023, 'fraction_numerical': 0.0, 'mean_word_length': 6.013698630136986, '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}}
Neighborhood preserving concept factorization algorithm for data representation

Non-negative matrix factorization (NMF) and concept factorization (CF) have attracted great attention in pattern recognition and machine learning. However, NMF and CF do not explore the local manifold structure among the high dimensional data. In this paper, a novel semi-supervised matrix factorization method, called Neighborhood Preserving Concept Factorization (NPCF), is proposed. The NPCF algorithm exploits local manifold structure information among the data with resorting to adding neighborhood preserving regulation. This method makes full use for the local geometric structure information in concept factorization. Therefore, the NPCF algorithm has more discriminate ability than traditional concept factorization. Meanwhile, the updating rules and the convergence proof of the NPCF algorithm are provided in this paper. Experiments on benchmark data sets demonstrate this proposed approach is more effective than other algorithms.