26 February 2023 in Engineering Applications of Artificial Intelligence
6 August 2024 in IEEE Transactions on Neural Networks and Learning Systems
Graph regularized nonnegative matrix factorization (GNMF) has been widely used in data representation due to its excellent dimensionality reduction. When it comes to clustering polluted data, GNMF inevitably learns inaccurate representations, leading to models that are unusually sensitive to outliers in the data. For example, in a face dataset, obscured by items such as a mask or glasses, there is a high probability that the graph regularization term incorrectly describes the association relationship for that sample, resulting in an incorrect elicitation in the matrix factorization process. In this article, a novel self-initiated unsupervised subspace learning method named robust nonnegative matrix factorization with self-initiated multigraph contrastive fusion (RNMF-SMGF) is proposed. RNMF-SMGF is capable of creating samples with different angles and learning different graph structures based on these different angles in a self-initiated method without changing the original data. In the process of subspace learning guided by graph regularization, these different graph structures are fused into a more accurate graph structure, along with entropy regularization, ${L_{2,1/2}}$ -norm constraints to facilitate the robust learning of the proposed model and the formation of different clusters in the low-dimensional space. To demonstrate the effectiveness of the proposed model in robust clustering, we have conducted extensive experiments on several benchmark datasets and demonstrated the effectiveness of the proposed method. The source code is available at: https://github.com/LstinWh/RNMF-SMGF/.
26 December 2023 in Engineering Applications of Artificial Intelligence
16 August 2022 in IEEE Access
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.
17 January 2025 in International Journal of Machine Learning and Cybernetics
18 November 2024 in Information Processing & Management