返回
Robust Non-Negative Matrix Tri-Factorization with Dual Hyper-Graph Regularization
DOI:10.26599/BDMA.2024.9020055.png)
摘要
En 中文
Non-negative Matrix Factorization (NMF) has been an ideal tool for machine learning. Non-negative Matrix Tri-Factorization (NMTF) is a generalization of NMF that incorporates a third non-negative factorization matrix, and has shown impressive clustering performance by imposing simultaneous orthogonality constraints on both sample and feature spaces. However, the performance of NMTF dramatically degrades if the data are contaminated with noises and outliers. Furthermore, the high-order geometric information is rarely considered. In this paper, a Robust NMTF with Dual Hyper-graph regularization (namely RDHNMTF) is introduced. Firstly, to enhance the robustness of NMTF, an improvement is made by utilizing the l(2,1)-norm to evaluate the reconstruction error. Secondly, a dual hyper-graph is established to uncover the higher-order inherent information within sample space and feature spaces for clustering. Furthermore, an alternating iteration algorithm is devised, and its convergence is thoroughly analyzed. Additionally, computational complexity is analyzed among comparison algorithms. The effectiveness of RDHNMTF is verified by benchmarking against ten cuttina-edae alaorithms across seven datasets corrupted with four types of noise.
Keyword:
Noise
Clustering algorithms
Machine learning
Big Data
Benchmark testing
Robustness
Data mining
Computational complexity
Convergence
Non-negative Matrix Tri-Factorization (NMTF)
l(2,1)-norm
dual hyper-graph regularization
co-clustering
期刊
IF:
6.2
论文数:
274
被引数:
1.0K
机构
暂无机构信息
引用论文
A nonnegative matrix factorization algorithm based on a discrete-time projection neural network
NEURAL NETWORKS
IF6.3
Less bins, less baboons: reducing access to anthropogenic food effectively decreases the urban foraging behavior of a troop of chacma baboons (Papio hamadryas ursinus) in a peri-urban area
Primates
IF0

