{"title":"基于兼容差别矩阵的核约简与属性约简算法","authors":"Chuanjian Yang, Hao Ge, Guangshun Yao, Lisheng Ma","doi":"10.1109/CINC.2009.212","DOIUrl":null,"url":null,"abstract":"In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method.","PeriodicalId":173506,"journal":{"name":"2009 International Conference on Computational Intelligence and Natural Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix\",\"authors\":\"Chuanjian Yang, Hao Ge, Guangshun Yao, Lisheng Ma\",\"doi\":\"10.1109/CINC.2009.212\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method.\",\"PeriodicalId\":173506,\"journal\":{\"name\":\"2009 International Conference on Computational Intelligence and Natural Computing\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computational Intelligence and Natural Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CINC.2009.212\",\"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 International Conference on Computational Intelligence and Natural Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINC.2009.212","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Core and Attribute Reduction Algorithms Based on Compatible Discernibility Matrix
In order to solve the shortcoming of computing core and attribute reduction from inconsistent decision table, in the paper, firstly, the definitions of compatible simplified decision table and compatible simplified discernibility matrix are given, and then the methods of computing core and attribute reduction are put forward. It is proved that the core and reduction acquired from the property are the core and reduction based on positive region. Secondly, the algorithms of computing core and attribute reduction based compatible discernibility matrix are proposed. Finally,the example is used to explain the correctness of the method.