返回
Robust Adaptive Graph Regularized Non-Negative Matrix Factorization
DOI:10.1109/ACCESS.2019.2924520.png)
摘要
En 中文
Data clustering, which aims to divide the given samples into several different groups, has drawn much attention in recent years. As a powerful tool, non-negative matrix factorization (NMF) has been applied successfully in clustering tasks. However, there are still two main limitations. First, the original NMF treats equally both noisy and clean data, which leads to high sensitivity to noises and outliers. Second, the performance of graph-based NMFs highly depends on the input graph, that is, if a low-quality graph is constructed to regularize NMF, the clustering results will be bad. To address the above-mentioned problems, we propose a novel robust adaptive graph regularized non-negative matrix factorization (RAGNMF) for data clustering. To be specific, we develop a robust weighted NMF (RWNMF) that can assign small weights to noises and outliers and large weights to clean data. Thus, the robustness of NMF is improved. Moreover, in the process of matrix factorization, metric learning is combined to choose some discriminative features and compute more appropriate distances of samples. Then, an adaptive graph is learned to well regularize the NMF. The experimental results demonstrate that the proposed RAGNMF can achieve better clustering performance then most of the state-of-the-art methods.
Keyword:
Non-negative matrix factorization
data clustering
graph learning
robustness
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
A Fast Non-Smooth Nonnegative Matrix Factorization for Learning Sparse Representation
IEEE ACCESS
IF3.6
Seroprevalence of bovine brucellosis and associated risk factors in and around Alage district, Ethiopia
SpringerPlus
IF0
Graph Regularized Non-Negative Low-Rank Matrix Factorization for Image Clustering用于图像聚类的图正则化非负低秩矩阵分解

