Indexed by:
Abstract:
Multi-view clustering has attracted increasing attention by reason of its ability to leverage the complementarity of multi-view data. Existing multi-view clustering methods have explored nonnegative matrix factorization to decompose a matrix into multiple matrices for feature representations from multi-view data, which are not discriminative enough to deal with the natural data containing complex information. Moreover, most of multi -view clustering methods prioritize the consensus information among multi-view data, leaving a large amount of information redundant and the clustering performance deterio-rated. To address these issues, this paper proposes a multi-view clustering framework that adopts a diversity loss for deep matrix factorization and reduces feature redundancy while obtaining more discriminative features. We then bridge the relation between deep auto -encoder and deep matrix factorization to optimize the objective function. This method avoids the challenges in the optimization process. Extensive experiments demonstrate that the proposed method is superior to state-of-the-art methods. (c) 2022 Elsevier Inc. All rights reserved.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
INFORMATION SCIENCES
ISSN: 0020-0255
Year: 2022
Volume: 610
Page: 114-125
8 . 1
JCR@2022
0 . 0 0 0
JCR@2023
ESI Discipline: COMPUTER SCIENCE;
ESI HC Threshold:61
JCR Journal Grade:1
CAS Journal Grade:1
Cited Count:
WoS CC Cited Count: 40
SCOPUS Cited Count: 23
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: