{"title":"粗糙集近似算子的表示","authors":"Y.Y. Yao","doi":"10.1109/AFSS.1996.583541","DOIUrl":null,"url":null,"abstract":"This paper examines several equivalent representations of rough set approximation operators in finite universes. Each of them can be either constructed from a binary relation or characterized by certain axioms. Their relationships are examined.","PeriodicalId":197019,"journal":{"name":"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Representations of rough set approximation operators\",\"authors\":\"Y.Y. Yao\",\"doi\":\"10.1109/AFSS.1996.583541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper examines several equivalent representations of rough set approximation operators in finite universes. Each of them can be either constructed from a binary relation or characterized by certain axioms. Their relationships are examined.\",\"PeriodicalId\":197019,\"journal\":{\"name\":\"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AFSS.1996.583541\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AFSS.1996.583541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Representations of rough set approximation operators
This paper examines several equivalent representations of rough set approximation operators in finite universes. Each of them can be either constructed from a binary relation or characterized by certain axioms. Their relationships are examined.