亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Scalable and Structural Multi-View Graph Clustering With Adaptive Anchor Fusion

计算机科学 聚类分析 可扩展性 融合 图形 人工智能 图论 模式识别(心理学) 理论计算机科学 算法 数据挖掘 数学 组合数学 语言学 哲学 数据库
作者
Siwei Wang,Xinwang Liu,Suyuan Liu,Wenxuan Tu,En Zhu
出处
期刊:IEEE transactions on image processing [Institute of Electrical and Electronics Engineers]
卷期号:33: 4627-4639 被引量:49
标识
DOI:10.1109/tip.2024.3444320
摘要

Anchor graph has been recently proposed to accelerate multi-view graph clustering and widely applied in various large-scale applications. Different from capturing full instance relationships, these methods choose small portion anchors among each view, construct single-view anchor graphs and combine them into the unified graph. Despite its efficiency, we observe that: (i) Existing mechanism adopts a separable two-step procedure-anchor graph construction and individual graph fusion, which may degrade the clustering performance. (ii)These methods determine the number of selected anchors to be equal among all the views, which may destruct the data distribution diversity. A more flexible multi-view anchor graph fusion framework with diverse magnitudes is desired to enhance the representation ability. (iii) During the latter fusion process, current anchor graph fusion framework follows simple linearly-combined style while the intrinsic clustering structures are ignored. To address these issues, we propose a novel scalable and flexible anchor graph fusion framework for multi-view graph clustering method in this paper. Specially, the anchor graph construction and graph alignment are jointly optimized in our unified framework to boost clustering quality. Moreover, we present a novel structural alignment regularization to adaptively fuse multiple anchor graphs with different magnitudes. In addition, our proposed method inherits the linear complexity of existing anchor strategies respecting to the sample number, which is time-economical for large-scale data. Experiments conducted on various benchmark datasets demonstrate the superiority and effectiveness of the newly proposed anchor graph fusion framework against the existing state-of-the-arts over the clustering performance promotion and time expenditure. Our code is publicly available at https://github.com/wangsiwei2010/SMVAGC-SF.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
不安的不可完成签到,获得积分10
7秒前
9秒前
沉默的从波完成签到,获得积分10
13秒前
傲娇的从灵完成签到,获得积分10
18秒前
19秒前
NexusExplorer应助雪山冰川采纳,获得10
25秒前
哈基伟发布了新的文献求助10
27秒前
39秒前
三枝雨完成签到,获得积分10
39秒前
烟花应助哈基伟采纳,获得10
45秒前
雪山冰川发布了新的文献求助10
45秒前
45秒前
友好碧完成签到 ,获得积分10
46秒前
幸福的盼芙完成签到,获得积分10
49秒前
三枝雨发布了新的文献求助10
53秒前
我吃柠檬发布了新的文献求助10
55秒前
个性花瓣完成签到,获得积分10
56秒前
研友_VZG7GZ应助Sarah采纳,获得30
57秒前
58秒前
Lucas应助我吃柠檬采纳,获得10
1分钟前
Owen应助我吃柠檬采纳,获得10
1分钟前
Cosmosurfer完成签到,获得积分0
1分钟前
1分钟前
我吃柠檬发布了新的文献求助10
1分钟前
wtian完成签到,获得积分10
1分钟前
1分钟前
深情安青应助科研通管家采纳,获得10
1分钟前
我吃柠檬发布了新的文献求助10
1分钟前
小辣椒完成签到,获得积分10
1分钟前
科研通AI6.4应助我吃柠檬采纳,获得10
1分钟前
orixero应助我吃柠檬采纳,获得10
1分钟前
zhaodan完成签到,获得积分10
1分钟前
飞哥与小佛完成签到,获得积分10
2分钟前
guyuzheng完成签到,获得积分10
2分钟前
爱听歌谷蓝完成签到,获得积分10
2分钟前
甜美尔烟完成签到,获得积分10
2分钟前
ZCN完成签到,获得积分10
2分钟前
2分钟前
ZCN发布了新的文献求助10
2分钟前
2分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Principles of town planning: translating concepts to applications 1000
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The role of consumer psychology in the marketing strategies of pop mart in Thailand 500
核安全综合知识2024版 500
Photothermal Science and Techniques 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7720453
求助须知:如何正确求助?哪些是违规求助? 9274138
关于积分的说明 20100614
捐赠科研通 7296765
什么是DOI,文献DOI怎么找? 3300175
关于科研通互助平台的介绍 2454014
邀请新用户注册赠送积分活动 2307653