期刊
KNOWLEDGE-BASED SYSTEMS
卷 194, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.knosys.2020.105582
关键词
Multi-view clustering; Co-orthogonal constraints; Non-negative matrix factorization
资金
- National Natural Science Foundation of China [61722304, 61727810, 61803096]
- Guangdong Science and Technology Foundation, China [2019B010118001, 2019B010121001, 2014A030306037]
- National Key Research and Development Project, China [2018YFB1802400]
Non-negative matrix factorization (NMF) has attracted sustaining attention in multi-view clustering, because of its ability of processing high-dimensional data. In order to learn the desired dimensionalreduced representation, a natural scheme is to add constraints to traditional NMF. Motivated by that the clustering performance is affected by the orthogonality of inner vectors of both the learned basis matrices and the representation matrices, a novel NMF model with co-orthogonal constraints is designed to deal with the multi-view clustering problem in this paper. For solving the proposed model, an efficient iterative updating algorithm is derived. And the corresponding convergence is proved, together with the analysis to its computational complexity. Experiments on five datasets are performed to present the advantages of the proposed algorithm against the state-of-the-art methods. (C) 2020 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据