摘要
基于一般随机信息系统上的属性约简方法讨论合成随机信息系统上的属性约简问题,分析它与原随机信息系统上属性约简问题之间的联系,并尝试讨论其上、下近似算子之间的关系,发现合成随机信息系统上的协调集可以通过两个原随机信息系统的协调集来构造;另一方面从包含度的角度讨论属性约简问题,验证合成随机信息系统上的包含度和原随机信息系统上包含度之间是否存在等价关系。最后通过实例验证了得出的结论。
This paper discusses the attribute reduction problem in combined random information systems based on the random information systems, and analyzes the relationship between the combined and the original information systems, as well as the relationship between the lower and upper approximation operators, then finds the consistent set on the combined random information systems can be constructed through two consistent sets of the original information systems. On the other hand, from the point of the inclusion degree it considers the reduction problem on the combined information systems,to verify whether the equivalent relationship exists between the inclusion degrees. Finally, the conclusions are verified through the instance.
出处
《计算机工程与应用》
CSCD
2014年第19期128-131,共4页
Computer Engineering and Applications
基金
国家自然科学基金(No.10901025)
关键词
合成随机信息系统
属性约简
协调集
近似算子
包含度
combined random information systems
attribute reduction
consistent set
approximation operators
inclusion degree