基于张量双曲切-p范数最小化的快速多视图聚类

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yongbo Yu , Zhoumin Lu , Jingjing Xue , Rong Wang , Zongcheng Miao , Feiping Nie
{"title":"基于张量双曲切-p范数最小化的快速多视图聚类","authors":"Yongbo Yu ,&nbsp;Zhoumin Lu ,&nbsp;Jingjing Xue ,&nbsp;Rong Wang ,&nbsp;Zongcheng Miao ,&nbsp;Feiping Nie","doi":"10.1016/j.patcog.2025.112195","DOIUrl":null,"url":null,"abstract":"<div><div>Tensor-based multi-view clustering methods have gained significant attention due to their ability to directly capture high-order information, often outperforming matrix-based approaches. However, these methods face challenges in efficiently processing large-scale datasets due to their high computational complexity. Moreover, most existing tensor-based approaches rely on the tensor nuclear norm (TNN) to approximate the tensor rank function. However, TNN penalizes larger singular values, which are essential for preserving critical structural information, thus constraining the extraction of multi-view information. To address these challenges, we propose a novel fast multi-view clustering method via tensor hyperbolic tangent-<span><math><mi>p</mi></math></span> norm minimization. First, we incorporate an efficient anchor selection strategy and construct tensors from anchor-based representations, significantly reducing the computational burden of tensor-based approaches for large-scale datasets. Second, we introduce the tensor hyperbolic tangent-<span><math><mi>p</mi></math></span> norm (THT<span><math><msub><mrow></mrow><mi>p</mi></msub></math></span>N), a more robust and accurate approximation of the tensor rank function, enabling improved extraction of multi-view consistency and complementarity. Extensive experiments on eight real-world datasets show that our proposed model not only surpasses tensor-based methods in clustering performance but also outperforms matrix-based methods in computational efficiency, establishing a new benchmark for fast multi-view clustering. Code is available at <span><span>https://github.com/usualheart/FTHMC</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"171 ","pages":"Article 112195"},"PeriodicalIF":7.6000,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast multi-view clustering via tensor hyperbolic tangent-p norm minimization\",\"authors\":\"Yongbo Yu ,&nbsp;Zhoumin Lu ,&nbsp;Jingjing Xue ,&nbsp;Rong Wang ,&nbsp;Zongcheng Miao ,&nbsp;Feiping Nie\",\"doi\":\"10.1016/j.patcog.2025.112195\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Tensor-based multi-view clustering methods have gained significant attention due to their ability to directly capture high-order information, often outperforming matrix-based approaches. However, these methods face challenges in efficiently processing large-scale datasets due to their high computational complexity. Moreover, most existing tensor-based approaches rely on the tensor nuclear norm (TNN) to approximate the tensor rank function. However, TNN penalizes larger singular values, which are essential for preserving critical structural information, thus constraining the extraction of multi-view information. To address these challenges, we propose a novel fast multi-view clustering method via tensor hyperbolic tangent-<span><math><mi>p</mi></math></span> norm minimization. First, we incorporate an efficient anchor selection strategy and construct tensors from anchor-based representations, significantly reducing the computational burden of tensor-based approaches for large-scale datasets. Second, we introduce the tensor hyperbolic tangent-<span><math><mi>p</mi></math></span> norm (THT<span><math><msub><mrow></mrow><mi>p</mi></msub></math></span>N), a more robust and accurate approximation of the tensor rank function, enabling improved extraction of multi-view consistency and complementarity. Extensive experiments on eight real-world datasets show that our proposed model not only surpasses tensor-based methods in clustering performance but also outperforms matrix-based methods in computational efficiency, establishing a new benchmark for fast multi-view clustering. Code is available at <span><span>https://github.com/usualheart/FTHMC</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":49713,\"journal\":{\"name\":\"Pattern Recognition\",\"volume\":\"171 \",\"pages\":\"Article 112195\"},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2025-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pattern Recognition\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0031320325008568\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325008568","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

基于张量的多视图聚类方法由于其直接捕获高阶信息的能力而获得了极大的关注,通常优于基于矩阵的方法。然而,这些方法由于计算复杂度高,在有效处理大规模数据集方面面临挑战。此外,大多数现有的基于张量的方法依赖于张量核范数(TNN)来近似张量秩函数。然而,TNN会惩罚较大的奇异值,这对于保留关键结构信息至关重要,从而限制了多视图信息的提取。为了解决这些问题,我们提出了一种新的基于张量双曲切-p范数最小化的快速多视图聚类方法。首先,我们结合了一种有效的锚点选择策略,并从基于锚点的表示中构造张量,显著减少了基于张量的大规模数据集方法的计算负担。其次,我们引入了张量双曲切-p范数(THTpN),这是一种更鲁棒和准确的张量秩函数近似,能够改进多视图一致性和互补性的提取。在8个真实数据集上的大量实验表明,我们提出的模型不仅在聚类性能上优于基于张量的方法,而且在计算效率上也优于基于矩阵的方法,为快速多视图聚类建立了新的基准。代码可从https://github.com/usualheart/FTHMC获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast multi-view clustering via tensor hyperbolic tangent-p norm minimization
Tensor-based multi-view clustering methods have gained significant attention due to their ability to directly capture high-order information, often outperforming matrix-based approaches. However, these methods face challenges in efficiently processing large-scale datasets due to their high computational complexity. Moreover, most existing tensor-based approaches rely on the tensor nuclear norm (TNN) to approximate the tensor rank function. However, TNN penalizes larger singular values, which are essential for preserving critical structural information, thus constraining the extraction of multi-view information. To address these challenges, we propose a novel fast multi-view clustering method via tensor hyperbolic tangent-p norm minimization. First, we incorporate an efficient anchor selection strategy and construct tensors from anchor-based representations, significantly reducing the computational burden of tensor-based approaches for large-scale datasets. Second, we introduce the tensor hyperbolic tangent-p norm (THTpN), a more robust and accurate approximation of the tensor rank function, enabling improved extraction of multi-view consistency and complementarity. Extensive experiments on eight real-world datasets show that our proposed model not only surpasses tensor-based methods in clustering performance but also outperforms matrix-based methods in computational efficiency, establishing a new benchmark for fast multi-view clustering. Code is available at https://github.com/usualheart/FTHMC.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Pattern Recognition
Pattern Recognition 工程技术-工程:电子与电气
CiteScore
14.40
自引率
16.20%
发文量
683
审稿时长
5.6 months
期刊介绍: The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信