Low-rank tucker decomposition for multi-view outlier detection based on meta-learning

IF 14.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Wei Lin , Kun Xie , Jiayin Li , Shiping Wang , Li Xu
{"title":"Low-rank tucker decomposition for multi-view outlier detection based on meta-learning","authors":"Wei Lin ,&nbsp;Kun Xie ,&nbsp;Jiayin Li ,&nbsp;Shiping Wang ,&nbsp;Li Xu","doi":"10.1016/j.inffus.2025.103313","DOIUrl":null,"url":null,"abstract":"<div><div>The analysis and mining of multi-view data have gained widespread attention, making multi-view anomaly detection a prominent research area. Despite notable advancements in the performance of existing multi-view anomaly detection methods, they still face certain limitations. (1) The existing methods fail to fully leverage the low-rank structure of multi-view data, which results in a lack of necessary interpretability when uncovering the latent relationships between views. (2) In the recovery of the consensus structure, the current methods achieve this merely through a simple aggregation process, lacking in-depth exploration and interaction between the potential structures of each view. To address these challenges, we propose the <u>L</u>ow-<u>R</u>ank <u>T</u>ucker <u>D</u>ecomposition based on <u>M</u>eta-Learning (LRTDM) for multi-view outlier detection. First, the low-rank Tucker decomposition is employed to reveal the low-rank structure of the multi-view self-expressive tensor. The factor matrices and core tensor effectively preserve and encode the latent structure of each view. This structured representation can efficiently capture the potential shared features between views, allowing for a more refined analysis of each individual view. Furthermore, meta-learning is utilized to define the learning and fusion of view-specific latent features as a nested optimization problem, which is solved alternately using a two-layer optimization scheme. Finally, anomalies are detected through the consensus matrix recovered from the latent representations and the error matrix during the self-expressive tensor learning process. Extensive experiments conducted on five publicly available datasets demonstrate the effectiveness of our approach. The results show that our algorithm improves detection accuracy by 2% to 10% compared to state-of-the-art methods.</div></div>","PeriodicalId":50367,"journal":{"name":"Information Fusion","volume":"123 ","pages":"Article 103313"},"PeriodicalIF":14.7000,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Fusion","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1566253525003860","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

The analysis and mining of multi-view data have gained widespread attention, making multi-view anomaly detection a prominent research area. Despite notable advancements in the performance of existing multi-view anomaly detection methods, they still face certain limitations. (1) The existing methods fail to fully leverage the low-rank structure of multi-view data, which results in a lack of necessary interpretability when uncovering the latent relationships between views. (2) In the recovery of the consensus structure, the current methods achieve this merely through a simple aggregation process, lacking in-depth exploration and interaction between the potential structures of each view. To address these challenges, we propose the Low-Rank Tucker Decomposition based on Meta-Learning (LRTDM) for multi-view outlier detection. First, the low-rank Tucker decomposition is employed to reveal the low-rank structure of the multi-view self-expressive tensor. The factor matrices and core tensor effectively preserve and encode the latent structure of each view. This structured representation can efficiently capture the potential shared features between views, allowing for a more refined analysis of each individual view. Furthermore, meta-learning is utilized to define the learning and fusion of view-specific latent features as a nested optimization problem, which is solved alternately using a two-layer optimization scheme. Finally, anomalies are detected through the consensus matrix recovered from the latent representations and the error matrix during the self-expressive tensor learning process. Extensive experiments conducted on five publicly available datasets demonstrate the effectiveness of our approach. The results show that our algorithm improves detection accuracy by 2% to 10% compared to state-of-the-art methods.
基于元学习的多视图异常点检测的低秩tucker分解
多视图数据的分析与挖掘得到了广泛的关注,多视图异常检测已成为一个重要的研究领域。尽管现有的多视点异常检测方法在性能上取得了显著进步,但仍然存在一定的局限性。(1)现有方法未能充分利用多视图数据的低秩结构,导致在揭示视图之间潜在关系时缺乏必要的可解释性。(2)在共识结构的恢复中,目前的方法仅通过简单的聚合过程来实现,缺乏对每个视图的潜在结构之间的深入探索和交互。为了解决这些挑战,我们提出了基于元学习的低秩塔克分解(LRTDM)用于多视图异常点检测。首先,采用低秩Tucker分解揭示多视图自表达张量的低秩结构;因子矩阵和核心张量有效地保存和编码了每个视图的潜在结构。这种结构化表示可以有效地捕获视图之间潜在的共享特性,从而允许对每个单独的视图进行更精细的分析。此外,利用元学习将特定视图潜在特征的学习和融合定义为嵌套优化问题,并使用两层优化方案交替解决。最后,通过自表达张量学习过程中从潜在表征和误差矩阵中恢复的共识矩阵来检测异常。在五个公开可用的数据集上进行的大量实验证明了我们方法的有效性。结果表明,与目前最先进的方法相比,我们的算法将检测精度提高了2%至10%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information Fusion
Information Fusion 工程技术-计算机:理论方法
CiteScore
33.20
自引率
4.30%
发文量
161
审稿时长
7.9 months
期刊介绍: Information Fusion serves as a central platform for showcasing advancements in multi-sensor, multi-source, multi-process information fusion, fostering collaboration among diverse disciplines driving its progress. It is the leading outlet for sharing research and development in this field, focusing on architectures, algorithms, and applications. Papers dealing with fundamental theoretical analyses as well as those demonstrating their application to real-world problems will be welcome.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信