Collaborative feature-weighted multi-view fuzzy c-means clustering
•Fuzzy c-means (FCM) clustering had been extended for handling multi-view data.•We propose a novel multi-view FCM (MVFCM) clustering algorithm with view and feature weights based on collaborative learning, called Co-FW-MVFCM.•The proposed Co-FW-MVFCM contains a two-step schema that includes a local...
Gespeichert in:
Veröffentlicht in: | Pattern recognition 2021-11, Vol.119, p.108064, Article 108064 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | •Fuzzy c-means (FCM) clustering had been extended for handling multi-view data.•We propose a novel multi-view FCM (MVFCM) clustering algorithm with view and feature weights based on collaborative learning, called Co-FW-MVFCM.•The proposed Co-FW-MVFCM contains a two-step schema that includes a local step and a collaborative step.•The Co-FW-MVFCM can give feature reduction to exclude redundant feature components during clustering processes.•Comparisons among Co-FW-MVFCM and existing MVFCM algorithms actually demonstrate the effectiveness and usefulness of Co-FW-MVFCM.
Fuzzy c-means (FCM) clustering had been extended for handling multi-view data with collaborative idea. However, these collaborative multi-view FCM treats multi-view data under equal importance of feature components. In general, different features should take different weights for clustering real multi-view data. In this paper, we propose a novel multi-view FCM (MVFCM) clustering algorithm with view and feature weights based on collaborative learning, called collaborative feature-weighted MVFCM (Co-FW-MVFCM). The Co-FW-MVFCM contains a two-step schema that includes a local step and a collaborative step. The local step is a single-view partition process to produce local partition clustering in each view, and the collaborative step is sharing information of their memberships between different views. These two steps are then continuing by an aggregation way to get a global result after collaboration. Furthermore, the embedded feature-weighted procedure in Co-FW-MVFCM can give feature reduction to exclude redundant/irrelevant feature components during clustering processes. Experiments with several data sets demonstrate that the proposed Co-FW-MVFCM algorithm can completely identify irrelevant feature components in each view and that, additionally, it can improve the performance of the algorithm. Comparisons of Co-FW-MVFCM with some existing MVFCM algorithms are made and also demonstrated the effectiveness and usefulness of the proposed Co-FW-MVFCM clustering algorithm. |
---|---|
ISSN: | 0031-3203 1873-5142 |
DOI: | 10.1016/j.patcog.2021.108064 |