一种高效完备的属性约简算法

2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI:10.1109/ICCSIT.2009.5234522

Jiang Yu, Du Bin

{"title":"一种高效完备的属性约简算法","authors":"Jiang Yu, Du Bin","doi":"10.1109/ICCSIT.2009.5234522","DOIUrl":null,"url":null,"abstract":"A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was introduced. This algorithm was composed of algorithm1 and algorithm2. Algorithm1 is to select those important condition attributes based on attribute frequency function in every iteration. Algorithm2 removes redundancy and incompatibility attributes in R found out by algorithm1. The time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given. Algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A efficiency complete algorithm for attribute reduction\",\"authors\":\"Jiang Yu, Du Bin\",\"doi\":\"10.1109/ICCSIT.2009.5234522\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was introduced. This algorithm was composed of algorithm1 and algorithm2. Algorithm1 is to select those important condition attributes based on attribute frequency function in every iteration. Algorithm2 removes redundancy and incompatibility attributes in R found out by algorithm1. The time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given. Algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.\",\"PeriodicalId\":342396,\"journal\":{\"name\":\"2009 2nd IEEE International Conference on Computer Science and Information Technology\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 2nd IEEE International Conference on Computer Science and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSIT.2009.5234522\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 2nd IEEE International Conference on Computer Science and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSIT.2009.5234522","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

提出了一种基于差别矩阵的粗糙集理论属性约简的完整算法。该算法由algorithm1和algorithm2组成。算法1是在每次迭代中根据属性频率函数选择那些重要的条件属性。Algorithm2去除了算法m1在R中发现的冗余和不兼容属性。分析了算法在最坏情况下的时间复杂度，并给出了算法的完备性证明。Algorithm1和algorithm2保证约简可能是最小的或更小的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A efficiency complete algorithm for attribute reduction

A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was introduced. This algorithm was composed of algorithm1 and algorithm2. Algorithm1 is to select those important condition attributes based on attribute frequency function in every iteration. Algorithm2 removes redundancy and incompatibility attributes in R found out by algorithm1. The time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given. Algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 2nd IEEE International Conference on Computer Science and Information Technology

自引率

0.00%

发文量