论文部分内容阅读
容差关系作为粗糙集扩展模型中常用的二元关系之一.许多其他扩展模型都是在容差关系基础上构建的,它使得不完备决策表中对象的划分更具有一般性,如何有效降低求解容差类的计算复杂性具有重要的意义.针对目前以容差关系为基础的不完备决策表的属性约简和知识获取算法时间复杂度不理想的问题,其主要原因是由于在求解不完备决策表的容差类时需消耗大量的计算时间,为了有效提高求解容差类的计算效率,引入基数排序和标记技术的设计思想,在此基础上提出一种高效的求解容差类算法,从而有效地降低了算法的时空复杂度,最后,通过实例分析和实验结果验证了新算法的有效性和可行性.
Tolerance relationship is one of the binary relations commonly used in rough set extension model.Many other extension models are constructed on the basis of tolerance relations, which makes the division of objects in the incomplete decision table more general and how to effectively reduce It is of great significance to solve the computational complexity of tolerance class.Aim at the problem that the time complexity of attribute reduction and knowledge acquisition algorithm of incomplete decision table based on tolerance relation is not ideal at present, In order to effectively improve the computational efficiency of solving tolerance classes, the design idea of cardinality sorting and marking technology is introduced. On the basis of this, an efficient tolerance class algorithm , Which effectively reduces the space-time complexity of the algorithm. Finally, the effectiveness and feasibility of the new algorithm are verified by examples and experimental results.