期刊
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
卷 44, 期 1, 页码 390-403出版社
IEEE COMPUTER SOC
DOI: 10.1109/TPAMI.2020.3007673
关键词
Matrix factorization; bi-stochastic graph; data clustering; robustness
资金
- National Key R&D Program of China [2017YFB1002202]
- National Natural Science Foundation of China [U1864204, 61773316, U1801262, 61871470]
Data clustering has attracted much attention, with various effective algorithms developed to handle the task. Non-negative matrix factorization (NMF) is considered powerful, but it has limitations in terms of sensitivity to noise and outliers. Existing graph-based NMF methods highly depend on the initial similarity graph and perform graph construction and matrix factorization separately, leading to suboptimal graph structures.
Data clustering, which is to partition the given data into different groups, has attracted much attention. Recently various effective algorithms have been developed to tackle the task. Among these methods, non-negative matrix factorization (NMF) has been demonstrated to be a powerful tool. However, there are still some problems. First, the standard NMF is sensitive to noises and outliers. Although l(2,1) norm based NMF improves the robustness, it is still affected easily by large noises. Second, for most graph regularized NMF, the performance highly depends on the initial similarity graph. Third, many graph-based NMF models perform the graph construction and matrix factorization in two separated steps. Thus the learned graph structure may not be optimal. To overcome the above drawbacks, we propose a robust bi-stochastic graph regularized matrix factorization (RBSMF) framework for data clustering. Specifically, we present a general loss function, which is more robust than the commonly used L-2 and L-1 functions. Besides, instead of keeping the graph fixed, we learn an adaptive similarity graph. Furthermore, the graph updating and matrix factorization are processed simultaneously, which can make the learned graph more appropriate for clustering. Extensive experiments have shown the proposed RBSMF outperforms other state-of-the-art methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据