自适应邻域保持的尺度鲁棒线性嵌入

IF 7.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pattern Recognition Pub Date : 2025-04-06 DOI:10.1016/j.patcog.2025.111625
Yunlong Gao , Qinting Wu , Xinjing Wang , Tingting Lin , Jinyan Pan , Chao Cao , Guifang Shao , Qingyuan Zhu , Feiping Nie
{"title":"自适应邻域保持的尺度鲁棒线性嵌入","authors":"Yunlong Gao ,&nbsp;Qinting Wu ,&nbsp;Xinjing Wang ,&nbsp;Tingting Lin ,&nbsp;Jinyan Pan ,&nbsp;Chao Cao ,&nbsp;Guifang Shao ,&nbsp;Qingyuan Zhu ,&nbsp;Feiping Nie","doi":"10.1016/j.patcog.2025.111625","DOIUrl":null,"url":null,"abstract":"<div><div>Manifold learning studies the invariability of geometry in continuous deformation. In recent years, feature space learning methods usually extract and preserve the essential structure of manifold data by preserving the affinity relationship between sample points in the embedded space, namely, the invariant property. However, in this paper, we find that only considering the affinity relationship cannot effectively extract and preserve the essential structure of data in the embedded space. Additionally, to solve the out-of-samples problem, manifold learning uses linear embedding instead of nonlinear embedding to preserve the manifold structure of data. However, linear embedding assumes that manifold data are global linear manifolds, thus the coupling of different local regions and the diversity in the spatial scales of different regions will further distort the original data and impair the efficiency of linear embedding for preserving the essential structure of data. To solve this problem, this paper proposes scaled robust linear embedding with adaptive neighbors preserving (SLE), which introduces the adaptive weighting based on local statistical characteristics to achieve flexible embedding for manifold data, where the adaptive weights can be regarded as the elastic deformation coefficients of local manifold structures of data. Due to the adaptive elastic deformation, SLE can reduces the gap between nonlinear embedding and linear embedding, thus improving the ability of linear embedding to preserve the essential structure of data. Moreover, SLE integrates the learning of elastic deformation coefficients, similarity learning, and subspace learning into a unified framework, therefore, the combination optimality of these three variables is guaranteed. An efficient alternative optimization algorithm is proposed to solve the challenging optimization problem, the theoretical analysis of its computational complexity and convergence is also performed in this paper. Eventually, SLE has been extensively experimented on both artificial and real-world datasets and compared with current state-of-the-art algorithms. The experimental results indicate that SLE has a strong ability in uncovering and preserving the essential structure of data in linear embedding space.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"165 ","pages":"Article 111625"},"PeriodicalIF":7.6000,"publicationDate":"2025-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scaled robust linear embedding with adaptive neighbors preserving\",\"authors\":\"Yunlong Gao ,&nbsp;Qinting Wu ,&nbsp;Xinjing Wang ,&nbsp;Tingting Lin ,&nbsp;Jinyan Pan ,&nbsp;Chao Cao ,&nbsp;Guifang Shao ,&nbsp;Qingyuan Zhu ,&nbsp;Feiping Nie\",\"doi\":\"10.1016/j.patcog.2025.111625\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Manifold learning studies the invariability of geometry in continuous deformation. In recent years, feature space learning methods usually extract and preserve the essential structure of manifold data by preserving the affinity relationship between sample points in the embedded space, namely, the invariant property. However, in this paper, we find that only considering the affinity relationship cannot effectively extract and preserve the essential structure of data in the embedded space. Additionally, to solve the out-of-samples problem, manifold learning uses linear embedding instead of nonlinear embedding to preserve the manifold structure of data. However, linear embedding assumes that manifold data are global linear manifolds, thus the coupling of different local regions and the diversity in the spatial scales of different regions will further distort the original data and impair the efficiency of linear embedding for preserving the essential structure of data. To solve this problem, this paper proposes scaled robust linear embedding with adaptive neighbors preserving (SLE), which introduces the adaptive weighting based on local statistical characteristics to achieve flexible embedding for manifold data, where the adaptive weights can be regarded as the elastic deformation coefficients of local manifold structures of data. Due to the adaptive elastic deformation, SLE can reduces the gap between nonlinear embedding and linear embedding, thus improving the ability of linear embedding to preserve the essential structure of data. Moreover, SLE integrates the learning of elastic deformation coefficients, similarity learning, and subspace learning into a unified framework, therefore, the combination optimality of these three variables is guaranteed. An efficient alternative optimization algorithm is proposed to solve the challenging optimization problem, the theoretical analysis of its computational complexity and convergence is also performed in this paper. Eventually, SLE has been extensively experimented on both artificial and real-world datasets and compared with current state-of-the-art algorithms. The experimental results indicate that SLE has a strong ability in uncovering and preserving the essential structure of data in linear embedding space.</div></div>\",\"PeriodicalId\":49713,\"journal\":{\"name\":\"Pattern Recognition\",\"volume\":\"165 \",\"pages\":\"Article 111625\"},\"PeriodicalIF\":7.6000,\"publicationDate\":\"2025-04-06\",\"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/S0031320325002857\",\"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/S0031320325002857","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

流形学习研究几何在连续变形中的不变性。近年来,特征空间学习方法通常通过保持样本点在嵌入空间中的亲和关系,即不变性来提取和保留流形数据的本质结构。然而,在本文中,我们发现仅考虑亲和关系不能有效地提取和保留嵌入空间中数据的本质结构。此外,为了解决样本外问题,流形学习使用线性嵌入而不是非线性嵌入来保持数据的流形结构。然而,线性嵌入假设流形数据是全局线性流形,不同局部区域的耦合和不同区域空间尺度的多样性会进一步扭曲原始数据,降低线性嵌入对数据本质结构的保护效率。针对这一问题,本文提出了带自适应邻域保持的尺度鲁棒线性嵌入方法(SLE),该方法引入了基于局部统计特征的自适应权值,实现了流形数据的柔性嵌入,其中自适应权值可视为数据局部流形结构的弹性变形系数。由于自适应弹性变形,SLE可以减小非线性嵌入与线性嵌入之间的差距,从而提高线性嵌入保留数据本质结构的能力。此外,SLE将弹性变形系数学习、相似学习和子空间学习整合到一个统一的框架中,保证了这三个变量的组合最优性。针对这一具有挑战性的优化问题,提出了一种高效的替代优化算法,并对其计算复杂度和收敛性进行了理论分析。最后,SLE在人工和现实数据集上进行了广泛的实验,并与当前最先进的算法进行了比较。实验结果表明,SLE具有较强的发现和保留线性嵌入空间中数据本质结构的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Scaled robust linear embedding with adaptive neighbors preserving
Manifold learning studies the invariability of geometry in continuous deformation. In recent years, feature space learning methods usually extract and preserve the essential structure of manifold data by preserving the affinity relationship between sample points in the embedded space, namely, the invariant property. However, in this paper, we find that only considering the affinity relationship cannot effectively extract and preserve the essential structure of data in the embedded space. Additionally, to solve the out-of-samples problem, manifold learning uses linear embedding instead of nonlinear embedding to preserve the manifold structure of data. However, linear embedding assumes that manifold data are global linear manifolds, thus the coupling of different local regions and the diversity in the spatial scales of different regions will further distort the original data and impair the efficiency of linear embedding for preserving the essential structure of data. To solve this problem, this paper proposes scaled robust linear embedding with adaptive neighbors preserving (SLE), which introduces the adaptive weighting based on local statistical characteristics to achieve flexible embedding for manifold data, where the adaptive weights can be regarded as the elastic deformation coefficients of local manifold structures of data. Due to the adaptive elastic deformation, SLE can reduces the gap between nonlinear embedding and linear embedding, thus improving the ability of linear embedding to preserve the essential structure of data. Moreover, SLE integrates the learning of elastic deformation coefficients, similarity learning, and subspace learning into a unified framework, therefore, the combination optimality of these three variables is guaranteed. An efficient alternative optimization algorithm is proposed to solve the challenging optimization problem, the theoretical analysis of its computational complexity and convergence is also performed in this paper. Eventually, SLE has been extensively experimented on both artificial and real-world datasets and compared with current state-of-the-art algorithms. The experimental results indicate that SLE has a strong ability in uncovering and preserving the essential structure of data in linear embedding space.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
Discussion on “Interpretable medical deep framework by logits-constraint attention guiding graph-based multi-scale fusion for Alzheimer’s disease analysis” by J. Xu, C. Yuan, X. Ma, H. Shang, X. Shi & X. Zhu. (Pattern Recognition, vol. 152, 2024”) 3D temporal-spatial convolutional LSTM network for assessing drug addiction treatment Pairwise joint symmetric uncertainty based on macro-neighborhood entropy for heterogeneous feature selection Low-rank fused modality assisted magnetic resonance imaging reconstruction via an anatomical variation adaptive transformer LCF3D: A robust and real-time late-cascade fusion framework for 3D object detection in autonomous driving
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1