Minimum Attribute Number in Decision Table Based on Maximum Entropy Principle

Min Dong, HuiYu Jiang
{"title":"Minimum Attribute Number in Decision Table Based on Maximum Entropy Principle","authors":"Min Dong, HuiYu Jiang","doi":"10.1109/CESCE.2010.140","DOIUrl":null,"url":null,"abstract":"Decision tables are always extremely important objects in data mining. People often require the more simple decision table in order to reduce the scale of tables. But a decision table is not always the most simple, so we have to try reducting it to learn which condition attributes are essential. It is known that the reduct results are not usually unique and the cardinal numbers of condition attributes set in different deducted tables of the same tables are different. From research findings on reducted tables, however, we can find out a simplest condition attributes set and call it Minimum Attribute Set. According to information theory, in this paper, we have deduced a formula to calculate the cardinal number of the Minimum Attribute Set, which is called Minimum Attribute Number. Moreover, before reducted we can just know whether the table is the simplest one or not. Eventually, we give a simple test example.","PeriodicalId":6371,"journal":{"name":"2010 International Conference on Challenges in Environmental Science and Computer Engineering","volume":"28 1","pages":"446-448"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Challenges in Environmental Science and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CESCE.2010.140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Decision tables are always extremely important objects in data mining. People often require the more simple decision table in order to reduce the scale of tables. But a decision table is not always the most simple, so we have to try reducting it to learn which condition attributes are essential. It is known that the reduct results are not usually unique and the cardinal numbers of condition attributes set in different deducted tables of the same tables are different. From research findings on reducted tables, however, we can find out a simplest condition attributes set and call it Minimum Attribute Set. According to information theory, in this paper, we have deduced a formula to calculate the cardinal number of the Minimum Attribute Set, which is called Minimum Attribute Number. Moreover, before reducted we can just know whether the table is the simplest one or not. Eventually, we give a simple test example.
基于最大熵原理的决策表最小属性数
决策表一直是数据挖掘中非常重要的对象。人们往往需要更简单的决策表,以减少表的规模。但决策表并不总是最简单的,所以我们必须尝试简化它,以了解哪些条件属性是必要的。已知约简结果通常不是唯一的,同一表的不同扣除表中设置的条件属性基数不同。然而,从约简表的研究成果中,我们可以找到一个最简单的条件属性集,称之为最小属性集。本文根据信息论,推导出最小属性集基数的计算公式,称为最小属性数。而且,在化简之前,我们只能知道这个表是不是最简单的表。最后,我们给出一个简单的测试示例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信