Yongbo Yu , Zhoumin Lu , Jingjing Xue , Rong Wang , Zongcheng Miao , Feiping Nie
{"title":"基于张量双曲切-p范数最小化的快速多视图聚类","authors":"Yongbo Yu , Zhoumin Lu , Jingjing Xue , Rong Wang , Zongcheng Miao , 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 , Zhoumin Lu , Jingjing Xue , Rong Wang , Zongcheng Miao , 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}
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- 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- norm (THTN), 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.
期刊介绍:
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.