{'fraction_non_alphanumeric': 0.018153117600631413, 'fraction_numerical': 0.0, 'mean_word_length': 5.708994708994709, '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}}
Adversarial Graph Regularized Deep Nonnegative Matrix Factorization for Data Representation

This work proposes a novel unsupervised deep non-negative matrix factorization (NMF) model called AGDNMF by deep exploration of the structure of the original data. Compared with the existing NMF research results, the model explores the deep association of data and constructs accurate spatial structure from a new perspective. Specifically, for the purpose of effectively learning low-dimensional representations of data. This work constructs a deep NMF method to approximate the coding structure of the original data, which enables AGDNMF to learn the hierarchical mapping relationship between the categories of the original data, and learn the hidden association information of the data from low-to-high in the middle layer. Moreover, the model gives an adversarial graph regularization representation for the manifoldization of data structures to push away the spatial distances between different sample clusters. Finally, based on the mathematical model of the proposed algorithm, the optimization strategy and convergence proof are given. Extensive experiments and data analysis demonstrate that the proposed model outperforms state-of-the-art unsupervised NMF methods.