Low-Rank Representation with Empirical Kernel Space Embedding of Manifolds

IF 6.3 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neural Networks Pub Date : 2025-05-01 Epub Date: 2025-01-25 DOI:10.1016/j.neunet.2025.107196
Wenyi Feng , Zhe Wang , Ting Xiao
{"title":"Low-Rank Representation with Empirical Kernel Space Embedding of Manifolds","authors":"Wenyi Feng ,&nbsp;Zhe Wang ,&nbsp;Ting Xiao","doi":"10.1016/j.neunet.2025.107196","DOIUrl":null,"url":null,"abstract":"<div><div>Low-Rank Representation (LRR) methods integrate low-rank constraints and projection operators to model the mapping from the sample space to low-dimensional manifolds. Nonetheless, existing approaches typically apply Euclidean algorithms directly to manifold data in the original input space, leading to suboptimal classification accuracy. To mitigate this limitation, we introduce an unsupervised low-rank projection learning method named Low-Rank Representation with Empirical Kernel Space Embedding of Manifolds (LRR-EKM). LRR-EKM leverages an empirical kernel mapping to project samples into the Reproduced Kernel Hilbert Space (RKHS), enabling the linear separability of non-linearly structured samples and facilitating improved low-dimensional manifold representations through Euclidean distance metrics. By incorporating a row sparsity constraint on the projection matrix, LRR-EKM not only identifies discriminative features and removes redundancies but also enhances the interpretability of the learned subspace. Additionally, we introduce a manifold structure preserving constraint to retain the original representation and distance information of the samples during projection. Comprehensive experimental evaluations across various real-world datasets validate the superior performance of our proposed method compared to the state-of-the-art methods. The code is publicly available at <span><span>https://github.com/ff-raw-war/LRR-EKM</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"185 ","pages":"Article 107196"},"PeriodicalIF":6.3000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0893608025000759","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/25 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Low-Rank Representation (LRR) methods integrate low-rank constraints and projection operators to model the mapping from the sample space to low-dimensional manifolds. Nonetheless, existing approaches typically apply Euclidean algorithms directly to manifold data in the original input space, leading to suboptimal classification accuracy. To mitigate this limitation, we introduce an unsupervised low-rank projection learning method named Low-Rank Representation with Empirical Kernel Space Embedding of Manifolds (LRR-EKM). LRR-EKM leverages an empirical kernel mapping to project samples into the Reproduced Kernel Hilbert Space (RKHS), enabling the linear separability of non-linearly structured samples and facilitating improved low-dimensional manifold representations through Euclidean distance metrics. By incorporating a row sparsity constraint on the projection matrix, LRR-EKM not only identifies discriminative features and removes redundancies but also enhances the interpretability of the learned subspace. Additionally, we introduce a manifold structure preserving constraint to retain the original representation and distance information of the samples during projection. Comprehensive experimental evaluations across various real-world datasets validate the superior performance of our proposed method compared to the state-of-the-art methods. The code is publicly available at https://github.com/ff-raw-war/LRR-EKM.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
流形的经验核空间嵌入的低秩表示
低秩表示(LRR)方法将低秩约束和投影算子结合起来,对样本空间到低维流形的映射进行建模。尽管如此,现有的方法通常将欧几里德算法直接应用于原始输入空间中的流形数据,导致分类精度次优。为了缓解这一局限性,我们引入了一种无监督的低秩投影学习方法——基于经验核空间嵌入流形的低秩表示(LRR-EKM)。LRR-EKM利用经验核映射将样本投影到再现核希尔伯特空间(RKHS),实现非线性结构样本的线性可分性,并通过欧几里得距离度量促进改进的低维流形表示。通过在投影矩阵上加入行稀疏性约束,LRR-EKM不仅可以识别判别特征并消除冗余,还可以增强学习子空间的可解释性。此外,我们引入了流形结构保持约束,以在投影过程中保留样本的原始表示和距离信息。跨各种真实世界数据集的综合实验评估验证了我们提出的方法与最先进的方法相比的优越性能。该代码可在https://github.com/ff-raw-war/LRR-EKM上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Neural Networks
Neural Networks 工程技术-计算机:人工智能
CiteScore
13.90
自引率
7.70%
发文量
425
审稿时长
67 days
期刊介绍: Neural Networks is a platform that aims to foster an international community of scholars and practitioners interested in neural networks, deep learning, and other approaches to artificial intelligence and machine learning. Our journal invites submissions covering various aspects of neural networks research, from computational neuroscience and cognitive modeling to mathematical analyses and engineering applications. By providing a forum for interdisciplinary discussions between biology and technology, we aim to encourage the development of biologically-inspired artificial intelligence.
期刊最新文献
Multi-neurotransmitter synergistically regulated basal ganglia reinforcement learning model HC-GLAD: Dual hyperbolic contrastive learning for unsupervised graph-level anomaly detection Revisiting deep information propagation: Fractal frontier and finite-size effects Topology structure optimization of reservoirs using GLMY homology A text-guided cross-hierarchical fusion and multi-task learning framework for multimodal sentiment analysis
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1