Scalable tri-factorization guided multi-view subspace clustering

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Knowledge-Based Systems Pub Date : 2025-02-08 DOI:10.1016/j.knosys.2025.113119
Guang-Yu Zhang , Chang-Bin Guan , Dong Huang , Zihao Wen , Chang-Dong Wang , Lei Xiao
{"title":"Scalable tri-factorization guided multi-view subspace clustering","authors":"Guang-Yu Zhang ,&nbsp;Chang-Bin Guan ,&nbsp;Dong Huang ,&nbsp;Zihao Wen ,&nbsp;Chang-Dong Wang ,&nbsp;Lei Xiao","doi":"10.1016/j.knosys.2025.113119","DOIUrl":null,"url":null,"abstract":"<div><div>Anchor-based Multi-view Subspace Clustering (AMSC) has exhibited its outstanding capability in large-scale multi-view clustering. Despite significant progress, previous AMSC approaches still suffer from two limitations. First, they mostly neglect the high-order correlation, which undermines their ability in discovering complex cluster structures. Second, they frequently overlook the potential connection between multi-view dimension reduction and anchor subspace clustering, which affects their robustness to low-quality views. In view of these issues, we present a Scalable Tri-factorization Guided Multi-view Subspace Clustering (ST-MSC) approach. Specifically, the proposed approach seeks to recover the latent sample-anchor relationships in multiple embedded spaces, where the multi-view anchor representations are stacked into a low-rank tensor to enhance their high-order correlations with tri-factorization guidance. Theoretical analysis indicates that the tri-factorization paradigm has inherent relevance with two mutually beneficial tasks, namely, the multi-view dimensionality reduction and the anchor-based multi-view subspace clustering. Furthermore, a simple yet fast algorithm is devised to minimize the objective model, where the latent embedding spaces and the anchor subspace structure can be iteratively updated in a unified manner. Experiments have been conducted to verify the effectiveness and efficiency of our ST-MSC approach in comparison with the advanced approaches.</div></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"312 ","pages":"Article 113119"},"PeriodicalIF":7.2000,"publicationDate":"2025-02-08","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/S0950705125001662","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

Anchor-based Multi-view Subspace Clustering (AMSC) has exhibited its outstanding capability in large-scale multi-view clustering. Despite significant progress, previous AMSC approaches still suffer from two limitations. First, they mostly neglect the high-order correlation, which undermines their ability in discovering complex cluster structures. Second, they frequently overlook the potential connection between multi-view dimension reduction and anchor subspace clustering, which affects their robustness to low-quality views. In view of these issues, we present a Scalable Tri-factorization Guided Multi-view Subspace Clustering (ST-MSC) approach. Specifically, the proposed approach seeks to recover the latent sample-anchor relationships in multiple embedded spaces, where the multi-view anchor representations are stacked into a low-rank tensor to enhance their high-order correlations with tri-factorization guidance. Theoretical analysis indicates that the tri-factorization paradigm has inherent relevance with two mutually beneficial tasks, namely, the multi-view dimensionality reduction and the anchor-based multi-view subspace clustering. Furthermore, a simple yet fast algorithm is devised to minimize the objective model, where the latent embedding spaces and the anchor subspace structure can be iteratively updated in a unified manner. Experiments have been conducted to verify the effectiveness and efficiency of our ST-MSC approach in comparison with the advanced approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约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.
期刊最新文献
Multiscale Spectral Augmentation for Graph Contrastive Learning for fMRI analysis to diagnose psychiatric disease An enhanced BiGAN architecture for network intrusion detection DHR-BLS: A Huber-type robust broad learning system with its distributed version Dynamic domain adaptive ensemble for intelligent fault diagnosis of machinery Multi-agent collaborative operation planning via cross-domain transfer learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1