基于最大相容类粗糙集模型的容差类求解算法研究

Study on Solving Algorithms of Compatible Classes of Rough Set with Maximal Compatible Classes as Primitive Granules

对基于最大相容类的粗糙集模型进行深入的研究,提出两种此模型下的容差类,并从最大相容类的求解算法入手进一步提出了这两种容差类求解的算法。通过实例验证了算法的有效性,从而为基于容差关系的粗糙集模型在处理不完备信息系统的问题上提供了重要的理论基础。

The model of the rough set based on the maximal compatible class is researched. Two new compatible classes for the model are introduced. The algorithm to solve the compatible classes is put forward through the solving of the maximal compatible classes. The validity of the algorithm is verified by examples and the important theoretical foundation can then be provided to solve the problem of the rough set model with incomplete information system.