4.6 Article

Uniform Distribution Non-Negative Matrix Factorization for Multiview Clustering

期刊

IEEE TRANSACTIONS ON CYBERNETICS
卷 51, 期 6, 页码 3249-3262

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2020.2984552

关键词

Matrix decomposition; Computational modeling; Analytical models; Manifolds; Data models; Convergence; Automation; Clustering; multiview learning; non-negative matrix factorization (NMF)

资金

  1. National Natural Science Foundation of China [61722304, 61727810, 61803096]
  2. Guangdong Science and Technology Foundation, China [2019B010154002, 2014A030306037]

向作者/读者索取更多资源

This article proposes a tri-factorization-based NMF model with an embedding matrix to generate decompositions with uniform distribution in the learned subspace, making the learned representations more discriminative and leading to higher clustering performance. Additionally, a new lemma is introduced to provide formulas about the partial derivation of the trace function with respect to an inner matrix, along with its theoretical proof, to develop a gradient-based algorithm for solving the proposed model and analyze its convergence and computational complexity. Experiments on six real-world datasets demonstrate the advantages of the proposed algorithm compared to existing baseline methods.
Multiview data processing has attracted sustained attention as it can provide more information for clustering. To integrate this information, one often utilizes the non-negative matrix factorization (NMF) scheme which can reduce the data from different views into the subspace with the same dimension. Motivated by the clustering performance being affected by the distribution of the data in the learned subspace, a tri-factorization-based NMF model with an embedding matrix is proposed in this article. This model tends to generate decompositions with uniform distribution, such that the learned representations are more discriminative. As a result, the obtained consensus matrix can be a better representative of the multiview data in the subspace, leading to higher clustering performance. Also, a new lemma is proposed to provide the formulas about the partial derivation of the trace function with respect to an inner matrix, together with its theoretical proof. Based on this lemma, a gradient-based algorithm is developed to solve the proposed model, and its convergence and computational complexity are analyzed. Experiments on six real-world datasets are performed to show the advantages of the proposed algorithm, with comparison to the existing baseline methods.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据