A Novel HOSFS Algorithm for Online Streaming Feature Selection

S. Sandhiya, U. Palani
{"title":"A Novel HOSFS Algorithm for Online Streaming Feature Selection","authors":"S. Sandhiya, U. Palani","doi":"10.1109/ICSCAN49426.2020.9262401","DOIUrl":null,"url":null,"abstract":"In recent days, Data stream mining is important for many of the real time and IOT based applications. Online feature selection is the one big topic of data stream mining which attracted researchers with intensive interest. This technique reduces the dimensionality of the streaming features by excluding inappropriate and redundant features. The researchers have proposed many online feature selection algorithm for streaming features like Grafting, Alpha-investing, OSFS, OGFS and SAOLA. Based on above studies the exiting algorithm has limitation over prediction accuracy and the large number of selected features. To overcome the limitations of above mentioned approaches, we propose an online feature selection algorithm for streaming features called Heuristic Online Streaming Feature Selection (HOSFS) which has advantages on choosing features from streaming features and omits the irrelevant and redundant features in real-time by using self-adaption sliding window protocol, and Heuristic function. The HOSFS algorithm assigns heuristic value to the features using the trained heuristic function and selects features with higher heuristic value where other features are considered as irrelevant features. This proposed technique results reduced number of strongly related features and obtains greater prediction accuracy with optimal features. HOSFS algorithm efficiency was tested with three different Health care datasets using MOA tools. Through the experimental outcomes, HOSFS has greater prediction accuracy and reduced number of selected features than alpha - investing, OSFS, and SAOLA.","PeriodicalId":6744,"journal":{"name":"2020 International Conference on System, Computation, Automation and Networking (ICSCAN)","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on System, Computation, Automation and Networking (ICSCAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSCAN49426.2020.9262401","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In recent days, Data stream mining is important for many of the real time and IOT based applications. Online feature selection is the one big topic of data stream mining which attracted researchers with intensive interest. This technique reduces the dimensionality of the streaming features by excluding inappropriate and redundant features. The researchers have proposed many online feature selection algorithm for streaming features like Grafting, Alpha-investing, OSFS, OGFS and SAOLA. Based on above studies the exiting algorithm has limitation over prediction accuracy and the large number of selected features. To overcome the limitations of above mentioned approaches, we propose an online feature selection algorithm for streaming features called Heuristic Online Streaming Feature Selection (HOSFS) which has advantages on choosing features from streaming features and omits the irrelevant and redundant features in real-time by using self-adaption sliding window protocol, and Heuristic function. The HOSFS algorithm assigns heuristic value to the features using the trained heuristic function and selects features with higher heuristic value where other features are considered as irrelevant features. This proposed technique results reduced number of strongly related features and obtains greater prediction accuracy with optimal features. HOSFS algorithm efficiency was tested with three different Health care datasets using MOA tools. Through the experimental outcomes, HOSFS has greater prediction accuracy and reduced number of selected features than alpha - investing, OSFS, and SAOLA.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的在线流媒体特征选择的HOSFS算法
最近,数据流挖掘对于许多基于实时和物联网的应用程序非常重要。在线特征选择是数据流挖掘的一大课题,引起了研究人员的极大兴趣。该技术通过排除不合适和冗余的特征来降低流特征的维数。研究人员提出了许多针对流特征的在线特征选择算法,如graft、Alpha-investing、OSFS、OGFS和SAOLA。基于以上研究,现有算法存在预测精度和特征选择量大的局限性。为了克服上述方法的局限性,我们提出了一种启发式在线流特征选择算法,即启发式在线流特征选择算法(hosss),该算法利用自适应滑动窗口协议和启发式函数,从流特征中选择特征,并实时忽略无关和冗余的特征。HOSFS算法使用训练好的启发式函数为特征分配启发式值,选择启发式值较高的特征,将其他特征视为无关特征。该方法减少了强相关特征的数量,利用最优特征获得了更高的预测精度。使用MOA工具在三个不同的医疗保健数据集上测试了HOSFS算法的效率。通过实验结果,HOSFS比alpha - investing、OSFS和SAOLA具有更高的预测精度和更少的选择特征数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Web Folder Phishing Discovery and Prevention with Customer Image Verification Taxonomy of keyword extraction in Facebook using Decision Tree algorithm in NLP A meta-analytic review of student satisfaction studies in higher education Enhanced Medical Data Security and Perceptual Quality for Healthcare services A Smart Trolley for Smart Shopping
×
引用
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