Robust multi-view fuzzy clustering with exponential transformation and automatic view weighting

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zhe Liu , Haoye Qiu , Muhammet Deveci , Sukumar Letchmunan , Luis Martínez
{"title":"Robust multi-view fuzzy clustering with exponential transformation and automatic view weighting","authors":"Zhe Liu ,&nbsp;Haoye Qiu ,&nbsp;Muhammet Deveci ,&nbsp;Sukumar Letchmunan ,&nbsp;Luis Martínez","doi":"10.1016/j.knosys.2025.113314","DOIUrl":null,"url":null,"abstract":"<div><div>Multi-view fuzzy clustering has gained widespread attention due to its unique capability to handle uncertainty through flexible membership assignment, allowing samples to belong to multiple clusters with varying supports, thereby providing a comprehensive understanding of multi-view data. This capability is particularly relevant to knowledge-driven systems that require interpretable integration of multi-view data. However, existing multi-view fuzzy clustering algorithms often struggle with handling noise and incorporating flexible weighting strategies for different views effectively. To address these challenges, this paper proposes four robust multi-view fuzzy clustering algorithms (RMFC-ET-VS, RMFC-ET-VP, RMFC-ET-MS, RMFC-ET-MP), which leverage an exponential transformation of Euclidean distance to effectively mitigate the impact of noise and outliers in the data, thereby enhancing clustering stability. Moreover, we introduce vector-based and matrix-based view weighting strategies, employing sum-to-1 and product-to-1 constraints to ensure that the most informative views contribute more effectively during clustering. The proposed algorithms offer a dual emphasis on robust distance metrics and adaptable view weighting, resulting in more accurate and resilient clustering outcomes. Extensive experiments on multiple real-world datasets demonstrate that the proposed algorithms significantly outperform existing multi-view clustering algorithms, both in terms of clustering performance and robustness.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"315 ","pages":"Article 113314"},"PeriodicalIF":7.2000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705125003612","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-view fuzzy clustering has gained widespread attention due to its unique capability to handle uncertainty through flexible membership assignment, allowing samples to belong to multiple clusters with varying supports, thereby providing a comprehensive understanding of multi-view data. This capability is particularly relevant to knowledge-driven systems that require interpretable integration of multi-view data. However, existing multi-view fuzzy clustering algorithms often struggle with handling noise and incorporating flexible weighting strategies for different views effectively. To address these challenges, this paper proposes four robust multi-view fuzzy clustering algorithms (RMFC-ET-VS, RMFC-ET-VP, RMFC-ET-MS, RMFC-ET-MP), which leverage an exponential transformation of Euclidean distance to effectively mitigate the impact of noise and outliers in the data, thereby enhancing clustering stability. Moreover, we introduce vector-based and matrix-based view weighting strategies, employing sum-to-1 and product-to-1 constraints to ensure that the most informative views contribute more effectively during clustering. The proposed algorithms offer a dual emphasis on robust distance metrics and adaptable view weighting, resulting in more accurate and resilient clustering outcomes. Extensive experiments on multiple real-world datasets demonstrate that the proposed algorithms significantly outperform existing multi-view clustering algorithms, both in terms of clustering performance and robustness.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信