Journal
KNOWLEDGE-BASED SYSTEMS
Volume 194, Issue -, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2020.105582
Keywords
Multi-view clustering; Co-orthogonal constraints; Non-negative matrix factorization
Categories
Funding
- 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]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available