Dual Anchor Graph Fuzzy Clustering for Multi-view Data
Multi-view anchor graph clustering has been a prominent research area in recent years, leading to the development of several effective and efficient methods. However, three challenges are faced by current multi-view anchor graph clustering methods. First, real-world data often exhibit uncertainty an...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on fuzzy systems 2024-10, p.1-15 |
---|---|
Hauptverfasser: | , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Multi-view anchor graph clustering has been a prominent research area in recent years, leading to the development of several effective and efficient methods. However, three challenges are faced by current multi-view anchor graph clustering methods. First, real-world data often exhibit uncertainty and poor discriminability, leading to suboptimal anchor graphs when directly extracted from the original data. Second, most existing methods assume the presence of common information between views and primarily explore it for clustering, thus neglecting view specific information. Third, further exploration and exploitation of the learned anchor graph to enhance clustering performance remains an open research question. To address these issues, a novel dual anchor graph fuzzy clustering method is proposed in this paper. First, a novel matrix factorization based dual anchor graph learning method is proposed to address the first two issues by extracting highly discriminative hidden representations for each view and subsequently deriving both common and specific anchor graphs from these hidden representations. Then, to address the third issue, a novel anchor graph fuzzy clustering method is developed with cooperative learning to exploit and utilize the common and specific anchor graphs fully. Meanwhile, a fuzzy membership structure preservation mechanism with dual anchor graphs is constructed to enhance clustering performance. Finally, negative Shannon entropy is further introduced to adaptively adjust the view weighing. Extensive experiments on several datasets demonstrate the effectiveness of the proposed method. |
---|---|
ISSN: | 1063-6706 1941-0034 |
DOI: | 10.1109/TFUZZ.2024.3489025 |