An Entropy-based Data Reduction Method for Data Preprocessing

Rocco Cassandro, Quing Li, Zhaojun Li
{"title":"An Entropy-based Data Reduction Method for Data Preprocessing","authors":"Rocco Cassandro, Quing Li, Zhaojun Li","doi":"10.1109/ICPHM57936.2023.10194224","DOIUrl":null,"url":null,"abstract":"The primary task in data mining is to find potential patterns or to discover hidden and useful knowledge from given data sets. However, with the increasing data quantity and exploding complexity, the capabilities of dealing with massive data becomes very crucial. The data preprocessing module is an integral part of data mining procedure, which aims to optimize input data usability for subsequent tasks such as classification, clustering, association analysis as well as other data mining algorithms. In general, data preprocessing procedures can effectively reduce the computational complexity while as possible to ensure accuracy and efficiency of prediction or classification, but meanwhile it even can assist to extract some unknown knowledge before applying more advanced data mining algorithms. This research proposes a three-patterns feature variables technique and an entropy-based data reduction (EBDR) algorithm for data preprocessing based on information theory. The goal is to explore high-purity subsets in which the values of an attribute are directly linked to specific class labels. The results of experiments demonstrate the efficacy of EBDR algorithm on datasets of varying sizes.","PeriodicalId":169274,"journal":{"name":"2023 IEEE International Conference on Prognostics and Health Management (ICPHM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE International Conference on Prognostics and Health Management (ICPHM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPHM57936.2023.10194224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The primary task in data mining is to find potential patterns or to discover hidden and useful knowledge from given data sets. However, with the increasing data quantity and exploding complexity, the capabilities of dealing with massive data becomes very crucial. The data preprocessing module is an integral part of data mining procedure, which aims to optimize input data usability for subsequent tasks such as classification, clustering, association analysis as well as other data mining algorithms. In general, data preprocessing procedures can effectively reduce the computational complexity while as possible to ensure accuracy and efficiency of prediction or classification, but meanwhile it even can assist to extract some unknown knowledge before applying more advanced data mining algorithms. This research proposes a three-patterns feature variables technique and an entropy-based data reduction (EBDR) algorithm for data preprocessing based on information theory. The goal is to explore high-purity subsets in which the values of an attribute are directly linked to specific class labels. The results of experiments demonstrate the efficacy of EBDR algorithm on datasets of varying sizes.
一种基于熵的数据约简预处理方法
数据挖掘的主要任务是从给定的数据集中发现潜在的模式或发现隐藏的和有用的知识。然而,随着数据量的增加和复杂性的爆炸式增长,处理海量数据的能力变得非常重要。数据预处理模块是数据挖掘过程中不可缺少的一部分,其目的是优化输入数据的可用性,以便于后续的任务,如分类、聚类、关联分析以及其他数据挖掘算法。一般来说,数据预处理程序可以有效地降低计算复杂度,同时尽可能保证预测或分类的准确性和效率,同时甚至可以在应用更高级的数据挖掘算法之前,帮助提取一些未知的知识。本文提出了一种基于信息论的三模式特征变量技术和基于熵的数据约简(EBDR)算法。目标是探索高纯度的子集,其中属性的值直接链接到特定的类标签。实验结果证明了EBDR算法在不同规模数据集上的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信