Interpretable Robust Feature Selection via Joint -Norms Minimization

Jingjing Lu, Shuangyan Yi, Jiaoyan Zhao, Yongsheng Liang, Wei Liu
{"title":"Interpretable Robust Feature Selection via Joint -Norms Minimization","authors":"Jingjing Lu, Shuangyan Yi, Jiaoyan Zhao, Yongsheng Liang, Wei Liu","doi":"10.1145/3457682.3457693","DOIUrl":null,"url":null,"abstract":"Dimension reduction is a hot topic in data processing field. The challenge lies in how to find a suitable feature subset in low-dimensional space to accurately summarize the important information in high-dimensional space, rather than redundant information or noise. This requires the proposed model to reasonably explain the importance of features and be robust to noise. In order to solve this problem, this paper proposes an interpretable robust feature selection method, in which both the reconstruction error term and the regularization term are constrained by -norm. The reconstruction error term can capture samples corroded by noise, while the regular term automatically finds a group of discriminative features on relatively clean samples. Experimental results show the effectiveness of the proposed method, especially on noise data sets.","PeriodicalId":142045,"journal":{"name":"2021 13th International Conference on Machine Learning and Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 13th International Conference on Machine Learning and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3457682.3457693","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Dimension reduction is a hot topic in data processing field. The challenge lies in how to find a suitable feature subset in low-dimensional space to accurately summarize the important information in high-dimensional space, rather than redundant information or noise. This requires the proposed model to reasonably explain the importance of features and be robust to noise. In order to solve this problem, this paper proposes an interpretable robust feature selection method, in which both the reconstruction error term and the regularization term are constrained by -norm. The reconstruction error term can capture samples corroded by noise, while the regular term automatically finds a group of discriminative features on relatively clean samples. Experimental results show the effectiveness of the proposed method, especially on noise data sets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于联合规范最小化的可解释鲁棒特征选择
降维是数据处理领域的一个热点问题。挑战在于如何在低维空间中找到合适的特征子集,准确地总结高维空间中的重要信息,而不是冗余信息或噪声。这就要求所提出的模型能够合理地解释特征的重要性,并且对噪声具有鲁棒性。为了解决这一问题,本文提出了一种可解释的鲁棒特征选择方法,其中重构误差项和正则化项都受到-范数约束。重构误差项可以捕获被噪声腐蚀的样本,而正则项可以在相对干净的样本上自动找到一组判别特征。实验结果表明了该方法的有效性,特别是在噪声数据集上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Corpus Construction and Entity Recognition for the Field of Industrial Robot Fault Diagnosis GCN2-NAA: Two-stage Graph Convolutional Networks with Node-Aware Attention for Joint Entity and Relation Extraction A Practical Indoor and Outdoor Seamless Navigation System Based on Electronic Map and Geomagnetism SC-DGCN: Sentiment Classification Based on Densely Connected Graph Convolutional Network Bird Songs Recognition Based on Ensemble Extreme Learning Machine
×
引用
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