.png){kind=icon}
.png){kind=icon}
Return
A robust multi-view knowledge transfer-based rough fuzzy C-means clustering algorithm
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-024-01431-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Rough fuzzy clustering algorithms have received extensive attention due to the excellent ability to handle overlapping and uncertainty of data. However, existing rough fuzzy clustering algorithms generally consider single view clustering, which neglects the clustering requirements of multiple views and results in the failure to identify diverse data structures in practical applications. In addition, rough fuzzy clustering algorithms are always sensitive to the initialized cluster centers and easily fall into local optimum. To solve the above problems, the multi-view and transfer learning are introduced into rough fuzzy clustering and a robust multi-view knowledge transfer-based rough fuzzy c-means clustering algorithm (MKT-RFCCA) is proposed in this paper. First, multiple distance metrics are adopted as multiple views to effectively recognize different data structures, and thus positively contribute to clustering. Second, a novel multi-view transfer-based rough fuzzy clustering objective function is constructed by using fuzzy memberships as transfer knowledge. This objective function can fully explore and utilize the potential information between multiple views and characterize the uncertainty information. Then, combining the statistical information of color histograms, an initialized centroids selection strategy is presented for image segmentation to overcome the instability and sensitivity caused by the random distribution of the initialized cluster centers. Finally, to reduce manual intervention, a distance-based adaptive threshold determination mechanism is designed to determine the threshold parameter for dividing the lower approximation and boundary region of rough fuzzy clusters during the iteration process. Experiments on synthetic datasets, real-world datasets, and noise-contaminated Berkeley and Weizmann images show that MKT-RFCCA obtains favorable clustering results. Especially, it provides satisfactory segmentation results on images with different types of noise and preserves more specific detail information of images.
Keywords:
Multi-view clustering
Transfer learning
Centroids initialization
Adaptive threshold
Rough fuzzy clustering
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K