Fuzzy Rank Based Parallel Online Feature Selection Method using Multiple Sliding Windows

IF 1.1 Q3 COMPUTER SCIENCE, THEORY & METHODS Open Computer Science Pub Date : 2021-01-01 DOI:10.1515/comp-2020-0169
B. Venkatesh, J. Anuradha
{"title":"Fuzzy Rank Based Parallel Online Feature Selection Method using Multiple Sliding Windows","authors":"B. Venkatesh, J. Anuradha","doi":"10.1515/comp-2020-0169","DOIUrl":null,"url":null,"abstract":"Abstract Nowadays, in real-world applications, the dimensions of data are generated dynamically, and the traditional batch feature selection methods are not suitable for streaming data. So, online streaming feature selection methods gained more attention but the existing methods had demerits like low classification accuracy, fails to avoid redundant and irrelevant features, and a higher number of features selected. In this paper, we propose a parallel online feature selection method using multiple sliding-windows and fuzzy fast-mRMR feature selection analysis, which is used for selecting minimum redundant and maximum relevant features, and also overcomes the drawbacks of existing online streaming feature selection methods. To increase the performance speed of the proposed method parallel processing is used. To evaluate the performance of the proposed online feature selection method k-NN, SVM, and Decision Tree Classifiers are used and compared against the state-of-the-art online feature selection methods. Evaluation metrics like Accuracy, Precision, Recall, F1-Score are used on benchmark datasets for performance analysis. From the experimental analysis, it is proved that the proposed method has achieved more than 95% accuracy for most of the datasets and performs well over other existing online streaming feature selection methods and also, overcomes the drawbacks of the existing methods.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":"11 1","pages":"275 - 287"},"PeriodicalIF":1.1000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0169","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Open Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/comp-2020-0169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 3

Abstract

Abstract Nowadays, in real-world applications, the dimensions of data are generated dynamically, and the traditional batch feature selection methods are not suitable for streaming data. So, online streaming feature selection methods gained more attention but the existing methods had demerits like low classification accuracy, fails to avoid redundant and irrelevant features, and a higher number of features selected. In this paper, we propose a parallel online feature selection method using multiple sliding-windows and fuzzy fast-mRMR feature selection analysis, which is used for selecting minimum redundant and maximum relevant features, and also overcomes the drawbacks of existing online streaming feature selection methods. To increase the performance speed of the proposed method parallel processing is used. To evaluate the performance of the proposed online feature selection method k-NN, SVM, and Decision Tree Classifiers are used and compared against the state-of-the-art online feature selection methods. Evaluation metrics like Accuracy, Precision, Recall, F1-Score are used on benchmark datasets for performance analysis. From the experimental analysis, it is proved that the proposed method has achieved more than 95% accuracy for most of the datasets and performs well over other existing online streaming feature selection methods and also, overcomes the drawbacks of the existing methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于模糊秩的多滑动窗口并行在线特征选择方法
摘要如今,在现实应用中,数据的维度是动态生成的,传统的批量特征选择方法不适合流式数据。因此,在线流特征选择方法受到了更多的关注,但现有方法存在分类精度低、无法避免冗余和不相关特征以及选择的特征数量较多等缺点。在本文中,我们提出了一种使用多个滑动窗口和模糊快速mRMR特征选择分析的并行在线特征选择方法,该方法用于选择最小冗余和最大相关特征,并克服了现有在线流特征选择方法的缺点。为了提高所提出的方法的性能速度,使用了并行处理。为了评估所提出的在线特征选择方法的性能,使用了k-NN、SVM和决策树分类器,并与最先进的在线特征选取方法进行了比较。在性能分析的基准数据集上使用准确性、精密度、召回率、F1分数等评估指标。实验分析表明,该方法对大多数数据集的准确率都达到了95%以上,与现有的其他在线流特征选择方法相比表现良好,克服了现有方法的不足。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Open Computer Science
Open Computer Science COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
4.00
自引率
0.00%
发文量
24
审稿时长
25 weeks
期刊最新文献
Artificial intelligence-based public safety data resource management in smart cities Application of fingerprint image fuzzy edge recognition algorithm in criminal technology Application of SSD network algorithm in panoramic video image vehicle detection system Data preprocessing impact on machine learning algorithm performance RFID supply chain data deconstruction method based on artificial intelligence technology
×
引用
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