Open continual sampling with hypersphere knowledge transfer for rapid feature selection

IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Applied Soft Computing Pub Date : 2025-02-01 Epub Date: 2024-12-30 DOI:10.1016/j.asoc.2024.112664
Xuemei Cao, Xiangkun Wang, Haoyang Liang, Bingjun Wei, Xin Yang
{"title":"Open continual sampling with hypersphere knowledge transfer for rapid feature selection","authors":"Xuemei Cao,&nbsp;Xiangkun Wang,&nbsp;Haoyang Liang,&nbsp;Bingjun Wei,&nbsp;Xin Yang","doi":"10.1016/j.asoc.2024.112664","DOIUrl":null,"url":null,"abstract":"<div><div>Feature selection is a widely used data preprocessing technique, but it still faces two major challenges: (1) data in open and dynamic environments may continually emerge unknown classes, and (2) the ever-growing scale of data. To address these challenges, this paper proposes a novel Open Continual Sampling (OCS) method that combines the advantages of continual learning and three-way sampling, aiming to discover unknown knowledge and transfer known knowledge. OCS can detect unknown classes by constructing a hypersphere knowledge base and sampling the most uncertain instances at each class decision boundary from the unknown data, thereby effectively reducing redundant sample computations. Based on OCS, we introduce a rapid feature selection framework (OCS-FS). Guided by the prior knowledge base, this framework rapidly calculates the importance of a small number of candidate features on representative samples, thereby incrementally selecting the optimal feature subset for the new data. After completing the learning process for the new period, the knowledge base is updated to reinforce old knowledge and integrate new knowledge. Extensive experiments on public benchmark datasets demonstrate that our method significantly outperforms existing state-of-the-art feature selection methods in both effectiveness and efficiency.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"170 ","pages":"Article 112664"},"PeriodicalIF":6.6000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494624014388","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/30 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Feature selection is a widely used data preprocessing technique, but it still faces two major challenges: (1) data in open and dynamic environments may continually emerge unknown classes, and (2) the ever-growing scale of data. To address these challenges, this paper proposes a novel Open Continual Sampling (OCS) method that combines the advantages of continual learning and three-way sampling, aiming to discover unknown knowledge and transfer known knowledge. OCS can detect unknown classes by constructing a hypersphere knowledge base and sampling the most uncertain instances at each class decision boundary from the unknown data, thereby effectively reducing redundant sample computations. Based on OCS, we introduce a rapid feature selection framework (OCS-FS). Guided by the prior knowledge base, this framework rapidly calculates the importance of a small number of candidate features on representative samples, thereby incrementally selecting the optimal feature subset for the new data. After completing the learning process for the new period, the knowledge base is updated to reinforce old knowledge and integrate new knowledge. Extensive experiments on public benchmark datasets demonstrate that our method significantly outperforms existing state-of-the-art feature selection methods in both effectiveness and efficiency.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
开放连续采样与超球知识转移快速特征选择
特征选择是一种广泛应用的数据预处理技术,但它仍然面临两大挑战:(1)开放和动态环境中的数据可能不断出现未知类;(2)不断增长的数据规模。为了解决这些问题,本文提出了一种新的开放式连续采样(OCS)方法,该方法结合了持续学习和三向采样的优点,旨在发现未知知识并转移已知知识。OCS通过构造一个超球知识库,从未知数据中抽取每个类决策边界处最不确定的实例,从而有效地减少了冗余样本计算。在此基础上,提出了快速特征选择框架(OCS- fs)。该框架在先验知识库的指导下,快速计算少量候选特征在代表性样本上的重要性,从而为新数据增量选择最优特征子集。在完成新阶段的学习过程后,对知识库进行更新,强化旧知识,整合新知识。在公共基准数据集上的大量实验表明,我们的方法在有效性和效率方面都明显优于现有的最先进的特征选择方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Applied Soft Computing
Applied Soft Computing 工程技术-计算机:跨学科应用
CiteScore
15.80
自引率
6.90%
发文量
874
审稿时长
10.9 months
期刊介绍: Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities. Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.
期刊最新文献
A robust framework for long-term photovoltaic power prediction through dual-mode modeling with transfer learning FedUnit: A Robust and Fair Federated Learning Framework for Malicious Client Detection and Free-Rider Contribution Evaluation Cloud-f-divergence based probabilistic hesitant fuzzy multi-criteria sorting method: An application to medical insurance fraud Understanding human-LLM interaction patterns in urban planning: A review and framework Non-intrusive three-phase load monitoring based on deep feature fusion and recursive interpretable screening
×
引用
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