已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

Multi-View Clustering via Multi-Stage Fusion

计算机科学 聚类分析 融合 数据挖掘 人工智能 语言学 哲学
作者
Gan Yu,Yunning You,Junjie Huang,Sen Xiang,Chang Tang,Wei Hu,Shan An
出处
期刊:IEEE Transactions on Multimedia [Institute of Electrical and Electronics Engineers]
卷期号:27: 4571-4583 被引量:15
标识
DOI:10.1109/tmm.2025.3535360
摘要

Multi-view clustering (MVC) exploits the information captured from diverse views to partition data into different groups and attracts much attention recently. Despite significant progress, most MVC methods fuse multi-view information via one-stage fusion while neglecting the merits of multi-stage fusion which causes insufficient in utilizing rich information within data and therefore degrades the clustering performance. To this end, designing a functional framework that can fully exploit multi-view information becomes a key challenge in multi-view clustering research. In this paper, we propose a novel multi-stage fusion method, which elegantly unifies the late and early fusion into one unified framework, to capture sufficient information underlying the multi-view data and to effectively reduce the effect of low-quality views. Specifically, we construct a low dimensional latent representation from multi-view data by learning proper correlation among multi-view data in the early fusion stage. The late fusion establishes a new optimal combinational data partition from base partitions constructed by spectral clustering, which suppresses the influence of low-quality basic partitions. Then we couple the low dimensional latent representation with the learned combinational data partition to share the same cluster structure by $k$-means and maximization alignment. As a result, we collaboratively learn an accurate and robust partition representation for the following clustering task. Besides, the late fusion and early fusion are jointly learned to achieve mutual collaboration for better performance. Finally, an alternating optimization algorithm is designed to solve the resultant optimization problem. Extensive experiments conducted on eight datasets show the superiority of our method in terms of effectiveness and efficiency.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
爆米花应助dq采纳,获得10
2秒前
堪冰蝶发布了新的文献求助10
3秒前
慕青应助wyg1994采纳,获得10
4秒前
wanci应助Edinburgh采纳,获得10
4秒前
Panda发布了新的文献求助10
5秒前
星空物语完成签到 ,获得积分10
7秒前
ding应助小烟花采纳,获得10
7秒前
Helen完成签到 ,获得积分10
7秒前
文明8完成签到,获得积分10
8秒前
8秒前
xiaoming完成签到 ,获得积分10
8秒前
9秒前
希望天下0贩的0应助翊琛采纳,获得10
10秒前
10秒前
柯彦发布了新的文献求助10
11秒前
人生捕手完成签到,获得积分10
13秒前
Alex发布了新的文献求助10
15秒前
Edinburgh发布了新的文献求助10
15秒前
狗狗饲养员完成签到 ,获得积分10
16秒前
找不到气得跳脚完成签到,获得积分10
17秒前
18秒前
20秒前
20秒前
21秒前
21秒前
啦啦啦啦完成签到,获得积分10
24秒前
研友_VZG7GZ应助北一采纳,获得10
25秒前
cx发布了新的文献求助10
25秒前
栗子完成签到,获得积分10
25秒前
28秒前
keke完成签到,获得积分10
28秒前
果子完成签到 ,获得积分10
31秒前
龚成明发布了新的文献求助10
32秒前
Nowind完成签到,获得积分10
33秒前
852应助Iceberg采纳,获得10
33秒前
34秒前
gogogo完成签到 ,获得积分10
34秒前
都美秋完成签到 ,获得积分10
35秒前
科研通AI6.3应助柚子采纳,获得10
35秒前
ilc发布了新的文献求助10
35秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
48V Low-voltage Power Distribution Network (PDN) Architecture Industry Report, 2024 800
ズームレンズの光学設計に関する研究 800
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7296883
求助须知:如何正确求助?哪些是违规求助? 8915361
关于积分的说明 18878179
捐赠科研通 6962881
什么是DOI,文献DOI怎么找? 3210485
关于科研通互助平台的介绍 2379761
邀请新用户注册赠送积分活动 2186979