Data pre-processing: a new algorithm for feature selection and data discretization

M. X. Ribeiro, Mônica Ribeiro Porto Ferreira, C. Traina, A. Traina
{"title":"Data pre-processing: a new algorithm for feature selection and data discretization","authors":"M. X. Ribeiro, Mônica Ribeiro Porto Ferreira, C. Traina, A. Traina","doi":"10.1145/1456223.1456277","DOIUrl":null,"url":null,"abstract":"Data pre-processing is a key element to improve the accuracy of data mining algorithms. In the pre-processing step, the data are treated in order to make the mining process achievable and effective. Data discretization and feature selection are two important tasks that can be performed prior to the learning phase and can significantly reduce the processing effort of the data mining algorithm. In this paper, we present Omega, a new algorithm for data discretization and feature selection. Omega performs simultaneously data discretization and feature selection. We validated Omega by comparing it with other well-known algorithms for data discretization (1R, ChiMerge and Chi2) and feature selection (DTM, Relief and Chi2). The experiments compared the effects of the pre-processing techniques in the results of the C4.5 algorithm (a well-known decision tree-based classifier). In the results, the data discretization provided by Omega generates the decision tree with one of the smallest average of the number of nodes and the feature selection given by Omega leads to one of the smallest average of error rate. These results indicates that Omega is well-suited to perform both, data discretization and feature selection, being highly appropriate for pre-processing data for data mining tasks.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"47 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Soft Computing as Transdisciplinary Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1456223.1456277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Data pre-processing is a key element to improve the accuracy of data mining algorithms. In the pre-processing step, the data are treated in order to make the mining process achievable and effective. Data discretization and feature selection are two important tasks that can be performed prior to the learning phase and can significantly reduce the processing effort of the data mining algorithm. In this paper, we present Omega, a new algorithm for data discretization and feature selection. Omega performs simultaneously data discretization and feature selection. We validated Omega by comparing it with other well-known algorithms for data discretization (1R, ChiMerge and Chi2) and feature selection (DTM, Relief and Chi2). The experiments compared the effects of the pre-processing techniques in the results of the C4.5 algorithm (a well-known decision tree-based classifier). In the results, the data discretization provided by Omega generates the decision tree with one of the smallest average of the number of nodes and the feature selection given by Omega leads to one of the smallest average of error rate. These results indicates that Omega is well-suited to perform both, data discretization and feature selection, being highly appropriate for pre-processing data for data mining tasks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
数据预处理:一种新的特征选择和数据离散化算法
数据预处理是提高数据挖掘算法准确性的关键环节。在预处理步骤中,为了使挖掘过程可实现和有效,对数据进行处理。数据离散化和特征选择是可以在学习阶段之前完成的两个重要任务,可以显著减少数据挖掘算法的处理工作量。本文提出了一种新的数据离散化和特征选择算法。Omega同时执行数据离散化和特征选择。我们通过将Omega与其他知名的数据离散(1R, ChiMerge和Chi2)和特征选择(DTM, Relief和Chi2)算法进行比较来验证Omega。实验比较了预处理技术在C4.5算法(一种著名的基于决策树的分类器)结果中的效果。在结果中,Omega提供的数据离散化生成了节点数平均值最小的决策树,Omega给出的特征选择生成了错误率平均值最小的决策树。这些结果表明,Omega非常适合执行数据离散化和特征选择,非常适合数据挖掘任务的预处理数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Novel cache management strategy for semantic caching in mobile environment Evolutionary multiobjective optimization and multiobjective fuzzy system design Network security simulation and evaluation A software based approach for autonomous projectile attitude and position estimation Fatigue level estimation of bill based on feature-selected acoustic energy pattern by using supervised SOM
×
引用
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