Graph Proxy Fusion: Consensus Graph Intermediated Multi-View Local Information Fusion Clustering

IF 8.4 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Haoran Li;Yulan Guo;Jiali You;Xiaojian You;Zhenwen Ren
{"title":"Graph Proxy Fusion: Consensus Graph Intermediated Multi-View Local Information Fusion Clustering","authors":"Haoran Li;Yulan Guo;Jiali You;Xiaojian You;Zhenwen Ren","doi":"10.1109/TMM.2024.3521803","DOIUrl":null,"url":null,"abstract":"Multi-view clustering (MVC) can fuse the information of multiple views for robust clustering result, among it two fusion strategies, <italic>early-fusion</i> and <italic>late-fusion</i> are widely adopted. Although they have derived many MVC methods, there are still two crucial questions: (1) <italic>early-fusion</i> forces multiple views to share a consensus latent representation, which compounds the challenge of excavating view-specific diverse local information and (2) <italic>late-fusion</i> generates view-partitions independently and then integrates them in the following clustering procedure, where the two procedures cannot guide each other and lack necessary negotiation. In view of this, we propose a novel Graph Proxy Fusion (GPF) method to preserve and fuse view-specific local information concertedly in one unified framework. Specifically, we first propose anchor-based local information learning to capture view-specific local structural information in bipartite graphs; meanwhile, a view-consensus graph learned through self-expressiveness-based proxy graph learning module is deemed as a higher-order proxy; following, the novel graph proxy fusion module integrally embeds all lower-order bipartite graphs in the higher-order proxy via higher-order correlation theory. As a novel fusion strategy, the proposed GPF efficiently investigates the valuable consensus and diverse information of multiple views. Experiments on various multi-view datasets demonstrate the superiority of our method.","PeriodicalId":13273,"journal":{"name":"IEEE Transactions on Multimedia","volume":"27 ","pages":"1736-1747"},"PeriodicalIF":8.4000,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Multimedia","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10829987/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Multi-view clustering (MVC) can fuse the information of multiple views for robust clustering result, among it two fusion strategies, early-fusion and late-fusion are widely adopted. Although they have derived many MVC methods, there are still two crucial questions: (1) early-fusion forces multiple views to share a consensus latent representation, which compounds the challenge of excavating view-specific diverse local information and (2) late-fusion generates view-partitions independently and then integrates them in the following clustering procedure, where the two procedures cannot guide each other and lack necessary negotiation. In view of this, we propose a novel Graph Proxy Fusion (GPF) method to preserve and fuse view-specific local information concertedly in one unified framework. Specifically, we first propose anchor-based local information learning to capture view-specific local structural information in bipartite graphs; meanwhile, a view-consensus graph learned through self-expressiveness-based proxy graph learning module is deemed as a higher-order proxy; following, the novel graph proxy fusion module integrally embeds all lower-order bipartite graphs in the higher-order proxy via higher-order correlation theory. As a novel fusion strategy, the proposed GPF efficiently investigates the valuable consensus and diverse information of multiple views. Experiments on various multi-view datasets demonstrate the superiority of our method.
图代理融合:共识图中介多视图局部信息融合聚类
多视图聚类(MVC)可以将多个视图的信息进行融合,从而获得鲁棒的聚类结果,其中早期融合和后期融合两种融合策略被广泛采用。尽管他们已经衍生出许多MVC方法,但仍然存在两个关键问题:(1)早期融合迫使多个视图共享一个共识潜在表示,这增加了挖掘特定于视图的不同局部信息的挑战;(2)后期融合独立生成视图分区,然后将它们集成到接下来的聚类过程中,这两个过程不能相互指导,缺乏必要的协商。鉴于此,我们提出了一种新的图代理融合(GPF)方法,在一个统一的框架中协调地保存和融合特定于视图的局部信息。具体来说,我们首先提出了基于锚点的局部信息学习来捕获二部图中特定视图的局部结构信息;同时,将基于自表达性的代理图学习模块学习到的视图一致图作为高阶代理;然后,利用高阶相关理论将所有低阶二部图集成到高阶代理中。作为一种新的融合策略,GPF能够有效地研究多视角的有价值共识和多样化信息。在多视图数据集上的实验证明了该方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Multimedia
IEEE Transactions on Multimedia 工程技术-电信学
CiteScore
11.70
自引率
11.00%
发文量
576
审稿时长
5.5 months
期刊介绍: The IEEE Transactions on Multimedia delves into diverse aspects of multimedia technology and applications, covering circuits, networking, signal processing, systems, software, and systems integration. The scope aligns with the Fields of Interest of the sponsors, ensuring a comprehensive exploration of research in multimedia.
×
引用
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学术官方微信