A genetic algorithm-based framework for online sparse feature selection in data streams.

IF 3.8 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Frontiers in Big Data Pub Date : 2026-02-09 eCollection Date: 2026-01-01 DOI:10.3389/fdata.2026.1782461
Guanyu Liu, Jinhang Liu, Guifan He, Yifan Liu, Huabo Bai, Min Zhou
{"title":"A genetic algorithm-based framework for online sparse feature selection in data streams.","authors":"Guanyu Liu, Jinhang Liu, Guifan He, Yifan Liu, Huabo Bai, Min Zhou","doi":"10.3389/fdata.2026.1782461","DOIUrl":null,"url":null,"abstract":"<p><p>High-dimensional streaming data implementations commonly utilize online streaming feature selection (OSFS) techniques. In practice, however, incomplete data due to equipment failures and technical constraints often poses a significant challenge. Online Sparse Streaming Feature Selection (OS<sup>2</sup>FS) tackles this issue by performing missing data imputation via latent factor analysis. Nevertheless, existing OS<sup>2</sup>FS approaches exhibit considerable limitations in feature evaluation, resulting in degraded performance. To address these shortcomings, this paper introduces a novel genetic algorithm-based online sparse streaming feature selection (GA-OS<sup>2</sup>FS) in data streams, which integrates two key innovations: (1) imputation of missing values using a latent factor analysis model, and (2) application of genetic algorithm to assess feature importance. Comprehensive experiments conducted on six real-world datasets show that GA-OS<sup>2</sup>FS surpasses state-of-the-art OSFS and OS<sup>2</sup>FS methods, consistently attaining higher accuracy through the selection of optimal feature subsets.</p>","PeriodicalId":52859,"journal":{"name":"Frontiers in Big Data","volume":"9 ","pages":"1782461"},"PeriodicalIF":3.8000,"publicationDate":"2026-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12926108/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in Big Data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3389/fdata.2026.1782461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/1 0:00:00","PubModel":"eCollection","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

High-dimensional streaming data implementations commonly utilize online streaming feature selection (OSFS) techniques. In practice, however, incomplete data due to equipment failures and technical constraints often poses a significant challenge. Online Sparse Streaming Feature Selection (OS2FS) tackles this issue by performing missing data imputation via latent factor analysis. Nevertheless, existing OS2FS approaches exhibit considerable limitations in feature evaluation, resulting in degraded performance. To address these shortcomings, this paper introduces a novel genetic algorithm-based online sparse streaming feature selection (GA-OS2FS) in data streams, which integrates two key innovations: (1) imputation of missing values using a latent factor analysis model, and (2) application of genetic algorithm to assess feature importance. Comprehensive experiments conducted on six real-world datasets show that GA-OS2FS surpasses state-of-the-art OSFS and OS2FS methods, consistently attaining higher accuracy through the selection of optimal feature subsets.

基于遗传算法的数据流在线稀疏特征选择框架。
高维流数据实现通常利用在线流特征选择(OSFS)技术。然而,在实践中,由于设备故障和技术限制而导致的数据不完整往往构成重大挑战。在线稀疏流特征选择(Online Sparse Streaming Feature Selection, OS2FS)通过潜在因子分析进行缺失数据的输入,解决了这一问题。然而,现有的OS2FS方法在特征评估方面表现出相当大的局限性,导致性能下降。为了解决这些不足,本文在数据流中引入了一种新的基于遗传算法的在线稀疏流特征选择(GA-OS2FS),该算法集成了两个关键创新:(1)使用潜在因素分析模型对缺失值进行估算,以及(2)应用遗传算法评估特征重要性。在六个真实数据集上进行的综合实验表明,GA-OS2FS优于最先进的OSFS和OS2FS方法,通过选择最优特征子集,始终获得更高的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
5.20
自引率
3.20%
发文量
122
审稿时长
13 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书