Indexed by:
Abstract:
In the past few decades, the clustering problem has made considerable progress, and co-clustering algo-rithms have attracted more attention. Compared with one-side clustering, co-clustering not only groups samples according to the distribution of features but also groups features according to the distribution of samples at the same time. This duality helps to explore the structural information of data, such as genes and texts. In this paper, a new co-clustering algorithm is proposed to simultaneously consider fea-ture weights, data noise, local manifolds, and global scatter, named robust weighted co-clustering with global and local discrimination. Furthermore, an alternate update rule is put forward to optimize objec-tive, theoretically proven to converge. Then, the algorithm's duality, robustness, and effectiveness have been verified on synthetic, corrupted, and real datasets, respectively. The runtime and parameter sensi-tivity of the algorithm are also analyzed. Finally, sufficient experiments clarify the competitiveness of our algorithm compared to other ones.(c) 2023 Elsevier Ltd. All rights reserved.
Keyword:
Reprint 's Address:
Version:
Source :
PATTERN RECOGNITION
ISSN: 0031-3203
Year: 2023
Volume: 138
7 . 5
JCR@2023
7 . 5 0 0
JCR@2023
ESI Discipline: ENGINEERING;
ESI HC Threshold:35
JCR Journal Grade:1
CAS Journal Grade:1
Cited Count:
WoS CC Cited Count: 2
SCOPUS Cited Count: 4
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: