基于张量的增强型嵌入式锚点学习,用于多视角聚类

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2024-10-09 DOI:10.1016/j.ins.2024.121532
Beihua Yang, Peng Song, Yuanbo Cheng, Shixuan Zhou, Zhaowei Liu
{"title":"基于张量的增强型嵌入式锚点学习,用于多视角聚类","authors":"Beihua Yang,&nbsp;Peng Song,&nbsp;Yuanbo Cheng,&nbsp;Shixuan Zhou,&nbsp;Zhaowei Liu","doi":"10.1016/j.ins.2024.121532","DOIUrl":null,"url":null,"abstract":"<div><div>Existing anchor graph based multi-view clustering methods can overcome the problem of high computational cost in traditional multi-view clustering methods. However, the anchor points selected from high-dimensional data often contain irrelevant noise and outliers, which would affect the clustering performance. To address this issue, we propose an embedding anchor based multi-view clustering method, called enhanced tensor based embedding anchor learning (ETEAL). Specifically, we unify the learning process of latent embedding space, anchor points, and anchor graphs into a common framework, which eliminates noise and redundant data in the original space and enhances the synergistic optimization between the components. Meanwhile, we employ an enhanced tensor strategy to constrain the embedding anchor graphs, which exploits the higher-order relationships between views and recovers the global low-rank property of the embedding anchor graphs. Finally, we develop an anchor graph fusion strategy, which significantly reduces the huge overhead of traditional graph fusion that requires the construction of complete graphs. Experimental results on eight benchmark datasets show that the proposed method significantly outperforms other state-of-the-art methods in terms of scalability and clustering accuracy.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121532"},"PeriodicalIF":8.1000,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhanced tensor based embedding anchor learning for multi-view clustering\",\"authors\":\"Beihua Yang,&nbsp;Peng Song,&nbsp;Yuanbo Cheng,&nbsp;Shixuan Zhou,&nbsp;Zhaowei Liu\",\"doi\":\"10.1016/j.ins.2024.121532\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Existing anchor graph based multi-view clustering methods can overcome the problem of high computational cost in traditional multi-view clustering methods. However, the anchor points selected from high-dimensional data often contain irrelevant noise and outliers, which would affect the clustering performance. To address this issue, we propose an embedding anchor based multi-view clustering method, called enhanced tensor based embedding anchor learning (ETEAL). Specifically, we unify the learning process of latent embedding space, anchor points, and anchor graphs into a common framework, which eliminates noise and redundant data in the original space and enhances the synergistic optimization between the components. Meanwhile, we employ an enhanced tensor strategy to constrain the embedding anchor graphs, which exploits the higher-order relationships between views and recovers the global low-rank property of the embedding anchor graphs. Finally, we develop an anchor graph fusion strategy, which significantly reduces the huge overhead of traditional graph fusion that requires the construction of complete graphs. Experimental results on eight benchmark datasets show that the proposed method significantly outperforms other state-of-the-art methods in terms of scalability and clustering accuracy.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"690 \",\"pages\":\"Article 121532\"},\"PeriodicalIF\":8.1000,\"publicationDate\":\"2024-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025524014464\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524014464","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

现有的基于锚点图的多视图聚类方法可以克服传统多视图聚类方法计算成本高的问题。然而,从高维数据中选取的锚点往往包含无关噪声和异常值,这会影响聚类性能。针对这一问题,我们提出了一种基于嵌入锚点的多视图聚类方法,即增强型基于张量的嵌入锚点学习(ETEAL)。具体来说,我们将潜在嵌入空间、锚点和锚图的学习过程统一到一个共同的框架中,从而消除了原始空间中的噪声和冗余数据,增强了各组成部分之间的协同优化。同时,我们采用了一种增强的张量策略来约束嵌入锚图,这种策略利用了视图之间的高阶关系,恢复了嵌入锚图的全局低阶属性。最后,我们开发了一种锚图融合策略,大大减少了传统图融合需要构建完整图的巨大开销。在八个基准数据集上的实验结果表明,所提出的方法在可扩展性和聚类准确性方面明显优于其他最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Enhanced tensor based embedding anchor learning for multi-view clustering
Existing anchor graph based multi-view clustering methods can overcome the problem of high computational cost in traditional multi-view clustering methods. However, the anchor points selected from high-dimensional data often contain irrelevant noise and outliers, which would affect the clustering performance. To address this issue, we propose an embedding anchor based multi-view clustering method, called enhanced tensor based embedding anchor learning (ETEAL). Specifically, we unify the learning process of latent embedding space, anchor points, and anchor graphs into a common framework, which eliminates noise and redundant data in the original space and enhances the synergistic optimization between the components. Meanwhile, we employ an enhanced tensor strategy to constrain the embedding anchor graphs, which exploits the higher-order relationships between views and recovers the global low-rank property of the embedding anchor graphs. Finally, we develop an anchor graph fusion strategy, which significantly reduces the huge overhead of traditional graph fusion that requires the construction of complete graphs. Experimental results on eight benchmark datasets show that the proposed method significantly outperforms other state-of-the-art methods in terms of scalability and clustering accuracy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Editorial Board Community structure testing by counting frequent common neighbor sets Finite-time secure synchronization for stochastic complex networks with delayed coupling under deception attacks: A two-step switching control scheme Adaptive granular data compression and interval granulation for efficient classification Introducing fairness in network visualization
×
引用
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