Multi-View Picture Fuzzy Clustering: A Novel Method for Partitioning Multi-View Relational Data

Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex, high-dimensional data that single-view methods cannot capture. Traditional fuzzy clustering techniques, such as Fuzzy C-Means (FCM), face significant challenges in handling uncertainty and the dependencies between different views. To overcome these limitations, we introduce a new multi-view fuzzy clustering approach that integrates picture fuzzy sets with a dual-anchor graph method for multi-view data, aiming to enhance clustering accuracy and robustness, termed Multi-view Picture Fuzzy Clustering (MPFC). In particular, the picture fuzzy set theory extends the capability to represent uncertainty by modeling three membership levels: membership degrees, neutral degrees, and refusal degrees. This allows for a more flexible representation of uncertain and conflicting data than traditional fuzzy models. Meanwhile, dual-anchor graphs exploit the similarity relationships between data points and integrate information across views. This combination improves stability, scalability, and robustness when handling noisy and heterogeneous data. Experimental results on several benchmark datasets demonstrate significant improvements in clustering accuracy and efficiency, outperforming traditional methods. Specifically, the MPFC algorithm demonstrates outstanding clustering performance on a variety of datasets, attaining a Purity (PUR) score of 0.6440 and an Accuracy (ACC) score of 0.6213 for the 3Sources dataset, underscoring its robustness and efficiency. The proposed approach significantly contributes to fields such as pattern recognition, multi-view relational data analysis, and large-scale clustering problems. Future work will focus on extending the method for semi-supervised multi-view clustering, aiming to enhance adaptability, scalability, and performance in real-world applications.

Authors

Publication Details

Journal
Computers, materials & continua/Computers, materials & continua (Print)
Published
2025-01-01
DOI
https://doi.org/10.32604/cmc.2025.065127
Citations
1
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-View Picture Fuzzy Clustering: A Novel Method for Partitioning Multi-View Relational Data

Nguyen Tien Huy, Nguyễn Long Giang, Pham Huy Thong, Luong Thi Hong Lan et al.
1 citations
Computers, materials & continua/Computers, materials & continua (Print)
Advanced Clustering Algorithms Research
2.48
article

Multi-View Picture Fuzzy Clustering: A Novel Method for Partitioning Multi-View Relational Data

Nguyen Tien Huy, Nguyễn Long Giang, Pham Huy Thong, Luong Thi Hong Lan, Hoang Thi Canh
article en
1 citations

Abstract

Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex, high-dimensional data that single-view methods cannot capture. Traditional fuzzy clustering techniques, such as Fuzzy C-Means (FCM), face significant challenges in handling uncertainty and the dependencies between different views. To overcome these limitations, we introduce a new multi-view fuzzy clustering approach that integrates picture fuzzy sets with a dual-anchor graph method for multi-view data, aiming to enhance clustering accuracy and robustness, termed Multi-view Picture Fuzzy Clustering (MPFC). In particular, the picture fuzzy set theory extends the capability to represent uncertainty by modeling three membership levels: membership degrees, neutral degrees, and refusal degrees. This allows for a more flexible representation of uncertain and conflicting data than traditional fuzzy models. Meanwhile, dual-anchor graphs exploit the similarity relationships between data points and integrate information across views. This combination improves stability, scalability, and robustness when handling noisy and heterogeneous data. Experimental results on several benchmark datasets demonstrate significant improvements in clustering accuracy and efficiency, outperforming traditional methods. Specifically, the MPFC algorithm demonstrates outstanding clustering performance on a variety of datasets, attaining a Purity (PUR) score of 0.6440 and an Accuracy (ACC) score of 0.6213 for the 3Sources dataset, underscoring its robustness and efficiency. The proposed approach significantly contributes to fields such as pattern recognition, multi-view relational data analysis, and large-scale clustering problems. Future work will focus on extending the method for semi-supervised multi-view clustering, aiming to enhance adaptability, scalability, and performance in real-world applications.

Computers, materials & continua/Computers, materials & continua (Print)Vol. 83(3)
Reduced inequalities
Openalex Percentile: Top 11%
Advanced Clustering Algorithms Research
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.