亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Latent Semantics and Anchor Graph Multi-Layer Learning for Multi-View Unsupervised Feature Selection

计算机科学 人工智能 语义学(计算机科学) 特征选择 图形 选择(遗传算法) 无监督学习 图层(电子) 自然语言处理 机器学习 理论计算机科学 程序设计语言 有机化学 化学
作者
Qi Liu,Suyuan Liu,Xinwang Liu,Jianhua Dai
出处
期刊:IEEE Transactions on Knowledge and Data Engineering [IEEE Computer Society]
卷期号:37 (10): 6032-6045 被引量:7
标识
DOI:10.1109/tkde.2025.3591515
摘要

In recent years, multi-view unsupervised feature selection has gained significant interest for its ability to efficiently handle multi-view datasets while offering better interpretability. However, most existing methods face the following challenges: First, the presence of noisy features in the data significantly impacts the process of learning accurate feature importance. Second, the selected features contain redundant information due to ignored redundancy between them. Third, graph structure learning is performed on all samples, resulting in large computational and space overheads, which is not conducive to expansion to large-scale data. To address these challenges, we propose a multi-view unsupervised feature selection method based on latent semantics and anchor graph learning. Specifically, this method designs a feature-weighted orthogonal regression and subspace learning framework to suppress noise interference in the consensus latent semantics discovery and anchor graph construction process, enhance the robustness of multi-view representation learning and reduce the computation of graph construction. Meanwhile, the proposed method employs explicit redundancy mitigation mechanisms that penalize discriminative weight allocation to highly correlated features. Furthermore, the proposed method unifies feature weighting, consensus latent semantics discovery, and adaptive graph learning within a multi-layer learning framework, enabling comprehensive feature importance evaluation through interactive learning between multiple layers. Finally, an efficient iterative algorithm is designed to solve the proposed model. The superiority of the proposed algorithm is demonstrated by comparing it with seven state-of-the-art algorithms on seven public multi-view datasets.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
赵赶超应助YWD采纳,获得10
1秒前
小蘑菇应助奋斗的白羊采纳,获得10
2秒前
渡人舟举报给我好好读书求助涉嫌违规
3秒前
flyinthesky完成签到,获得积分10
4秒前
5秒前
7秒前
赵赶超应助YWD采纳,获得10
9秒前
HC完成签到,获得积分10
15秒前
温婉的乐荷完成签到,获得积分10
22秒前
zzz完成签到 ,获得积分10
25秒前
张晓祁完成签到,获得积分10
25秒前
31秒前
yueying完成签到,获得积分0
35秒前
希望天下0贩的0应助eay采纳,获得10
38秒前
码头完成签到 ,获得积分10
39秒前
50秒前
eay发布了新的文献求助10
54秒前
58秒前
58秒前
1分钟前
1分钟前
nhzz2023完成签到 ,获得积分0
1分钟前
总是很简单完成签到 ,获得积分10
1分钟前
eay完成签到,获得积分20
1分钟前
落后乘风完成签到,获得积分10
1分钟前
1分钟前
1分钟前
无语的巨人完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
Biu发布了新的文献求助10
1分钟前
1分钟前
朴实无招完成签到,获得积分10
1分钟前
1分钟前
2分钟前
小乐完成签到 ,获得积分10
2分钟前
神勇寄风完成签到,获得积分10
2分钟前
不吵完成签到,获得积分10
2分钟前
2分钟前
skotrie189完成签到,获得积分10
2分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Römisch-Germanische Forschungen 1000
Social Psychology (第二版) 700
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The fast track to determining transfer functions of linear circuits: The student guide 500
The Analytical and Numerical Solution of Electric and Magnetic Fields 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7612225
求助须知:如何正确求助?哪些是违规求助? 9187738
关于积分的说明 19683395
捐赠科研通 7185893
什么是DOI,文献DOI怎么找? 3270696
关于科研通互助平台的介绍 2434268
邀请新用户注册赠送积分活动 2265570