A rough set approach to mining concise rules from inconsistent data

Ying Sai, P. Nie, Ru-zhi Xu, Jincai Huang
{"title":"A rough set approach to mining concise rules from inconsistent data","authors":"Ying Sai, P. Nie, Ru-zhi Xu, Jincai Huang","doi":"10.1109/GRC.2006.1635808","DOIUrl":null,"url":null,"abstract":"In this paper, a rough set approach to mining concise rules from inconsistent data is proposed. The approach is based on the variable precision rough set model and deals with inconsistent data. By first computing the reduct for each concept, then computing the reduct for each object, this approach adopts a heuristic algorithm HCRI to build concise classification rules for each concept satisfying the given classification accuracy. HASH functions are designed for the implementation, which substantially reduce the computational complexity of the algorithm. UCI data sets are used to test the proposed approach. The results show that our approach effectively eliminates noises in data and greatly improves the total data reduction rate","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRC.2006.1635808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

In this paper, a rough set approach to mining concise rules from inconsistent data is proposed. The approach is based on the variable precision rough set model and deals with inconsistent data. By first computing the reduct for each concept, then computing the reduct for each object, this approach adopts a heuristic algorithm HCRI to build concise classification rules for each concept satisfying the given classification accuracy. HASH functions are designed for the implementation, which substantially reduce the computational complexity of the algorithm. UCI data sets are used to test the proposed approach. The results show that our approach effectively eliminates noises in data and greatly improves the total data reduction rate
从不一致数据中挖掘简明规则的粗糙集方法
本文提出了一种从不一致数据中挖掘简明规则的粗糙集方法。该方法基于变精度粗糙集模型,处理不一致数据。该方法首先计算每个概念的约简,然后计算每个对象的约简,采用启发式算法HCRI为满足给定分类精度的每个概念构建简洁的分类规则。为实现设计了HASH函数,大大降低了算法的计算复杂度。UCI数据集用于测试所提出的方法。结果表明,该方法有效地消除了数据中的噪声,大大提高了总数据约简率
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信