{"title":"区间值信息系统中的知识约简","authors":"D. Miao, N. Zhang, Xiaodong Yue","doi":"10.1109/COGINF.2009.5250721","DOIUrl":null,"url":null,"abstract":"In this paper, the concept of α -maximal consistent blocks is proposed to formulate the new rough approximations to an arbitrary object set in interval-valued information systems. The a -maximal consistent blocks can provide the simpler discernibility matrices and discernibility functions in reduction of interval-valued information systems. This means that they can provide a more efficient computation for knowledge acquisitions. Numerical examples are employed to substantiate the conceptual arguments.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Knowledge reduction in interval-valued information systems\",\"authors\":\"D. Miao, N. Zhang, Xiaodong Yue\",\"doi\":\"10.1109/COGINF.2009.5250721\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the concept of α -maximal consistent blocks is proposed to formulate the new rough approximations to an arbitrary object set in interval-valued information systems. The a -maximal consistent blocks can provide the simpler discernibility matrices and discernibility functions in reduction of interval-valued information systems. This means that they can provide a more efficient computation for knowledge acquisitions. Numerical examples are employed to substantiate the conceptual arguments.\",\"PeriodicalId\":420853,\"journal\":{\"name\":\"2009 8th IEEE International Conference on Cognitive Informatics\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 8th IEEE International Conference on Cognitive Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COGINF.2009.5250721\",\"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 8th IEEE International Conference on Cognitive Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COGINF.2009.5250721","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Knowledge reduction in interval-valued information systems
In this paper, the concept of α -maximal consistent blocks is proposed to formulate the new rough approximations to an arbitrary object set in interval-valued information systems. The a -maximal consistent blocks can provide the simpler discernibility matrices and discernibility functions in reduction of interval-valued information systems. This means that they can provide a more efficient computation for knowledge acquisitions. Numerical examples are employed to substantiate the conceptual arguments.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
