{"title":"不完全信息的粗略近似","authors":"Jun Luo, K. Qin","doi":"10.14569/IJARAI.2014.031202","DOIUrl":null,"url":null,"abstract":"Rough set under incomplete information has been extensively studied. Based on valued tolerance relation for incomplete information system, several approaches were presented to dealing with the attribute reductions and rule extraction. We point out some drawbacks in the existing papers for valued tolerance relation based rough approximations and propose a new kind of rough approximation operators which is a generalization of Pawlak approximation operators for complete information system. Some basic properties of the approximation operators are investigated. Keywords—Rough set; tolerance relation; valued tolerance relation","PeriodicalId":323606,"journal":{"name":"International Journal of Advanced Research in Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Rough Approximations for Incomplete Information\",\"authors\":\"Jun Luo, K. Qin\",\"doi\":\"10.14569/IJARAI.2014.031202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Rough set under incomplete information has been extensively studied. Based on valued tolerance relation for incomplete information system, several approaches were presented to dealing with the attribute reductions and rule extraction. We point out some drawbacks in the existing papers for valued tolerance relation based rough approximations and propose a new kind of rough approximation operators which is a generalization of Pawlak approximation operators for complete information system. Some basic properties of the approximation operators are investigated. Keywords—Rough set; tolerance relation; valued tolerance relation\",\"PeriodicalId\":323606,\"journal\":{\"name\":\"International Journal of Advanced Research in Artificial Intelligence\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Advanced Research in Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14569/IJARAI.2014.031202\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advanced Research in Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14569/IJARAI.2014.031202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Rough set under incomplete information has been extensively studied. Based on valued tolerance relation for incomplete information system, several approaches were presented to dealing with the attribute reductions and rule extraction. We point out some drawbacks in the existing papers for valued tolerance relation based rough approximations and propose a new kind of rough approximation operators which is a generalization of Pawlak approximation operators for complete information system. Some basic properties of the approximation operators are investigated. Keywords—Rough set; tolerance relation; valued tolerance relation