Weighted Concept Factorization Based Incomplete Multi-view Clustering

Ghufran Ahmad Khan;Jalaluddin Khan;Taushif Anwar;Zubair Ashraf;Mohammad Hafeez Javed;Bassoma Diallo
{"title":"Weighted Concept Factorization Based Incomplete Multi-view Clustering","authors":"Ghufran Ahmad Khan;Jalaluddin Khan;Taushif Anwar;Zubair Ashraf;Mohammad Hafeez Javed;Bassoma Diallo","doi":"10.1109/TAI.2024.3433379","DOIUrl":null,"url":null,"abstract":"The primary objective of classical multiview clustering (MVC) is to categorize data into separate clusters under the assumption that all perspectives are completely available. However, in practical situations, it is common to encounter cases where not all viewpoints of the data are accessible. This limitation can impede the effectiveness of traditional MVC methods. The incompleteness of the clustering of multiview data has witnessed substantial progress in recent years due to its promising applications. In response to the aforementioned issue, we have tackled it by introducing an inventive MVC algorithm that is tailored to handle incomplete data from various views. Additionally, we have proposed a distinct objective function that leverages a weighted concept factorization technique to address the absence of data instances within each incomplete perspective. To address inconsistencies between different views, we introduced a coregularization factor, which operates in conjunction with a shared consensus matrix. It is important to highlight that the proposed objective function is intrinsically nonconvex, presenting challenges in terms of optimization. To secure the optimal solution for this objective function, we have implemented an iterative optimization approach to reach the local minima for our method. To underscore the efficacy and validation of our approach, we experimented with real-world datasets and used state-of-the-art methods to perform comparative assessments.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 11","pages":"5699-5708"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10609760/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The primary objective of classical multiview clustering (MVC) is to categorize data into separate clusters under the assumption that all perspectives are completely available. However, in practical situations, it is common to encounter cases where not all viewpoints of the data are accessible. This limitation can impede the effectiveness of traditional MVC methods. The incompleteness of the clustering of multiview data has witnessed substantial progress in recent years due to its promising applications. In response to the aforementioned issue, we have tackled it by introducing an inventive MVC algorithm that is tailored to handle incomplete data from various views. Additionally, we have proposed a distinct objective function that leverages a weighted concept factorization technique to address the absence of data instances within each incomplete perspective. To address inconsistencies between different views, we introduced a coregularization factor, which operates in conjunction with a shared consensus matrix. It is important to highlight that the proposed objective function is intrinsically nonconvex, presenting challenges in terms of optimization. To secure the optimal solution for this objective function, we have implemented an iterative optimization approach to reach the local minima for our method. To underscore the efficacy and validation of our approach, we experimented with real-world datasets and used state-of-the-art methods to perform comparative assessments.
基于加权概念因式分解的不完整多视角聚类
经典多视角聚类(MVC)的主要目的是在假设所有视角都完全可用的情况下,将数据归类到不同的聚类中。然而,在实际情况中,经常会遇到并非数据的所有视角都可访问的情况。这种限制会妨碍传统 MVC 方法的有效性。近年来,多视角数据聚类的不完整性因其广阔的应用前景而取得了长足的进步。针对上述问题,我们引入了一种创造性的 MVC 算法,专门用于处理来自不同视图的不完整数据。此外,我们还提出了一个独特的目标函数,利用加权概念因式分解技术来解决每个不完整视角中缺乏数据实例的问题。为了解决不同观点之间的不一致性,我们引入了一个核心模块化因子,该因子与共享共识矩阵共同发挥作用。需要强调的是,所提出的目标函数本质上是非凸的,这给优化带来了挑战。为了确保该目标函数的最优解,我们采用了迭代优化方法,以达到我们方法的局部最小值。为了强调我们方法的有效性和验证,我们使用真实世界的数据集进行了实验,并使用最先进的方法进行了比较评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
×
引用
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学术官方微信