【摘要】 粗糙集理论是一种新的处理模糊和不确定知识的数学工具。知识约简是粗糙集理论研究中的重要内容之一,现已证明寻找信息系统的最小约简是NP-hard问题。该文提出一个基于绝对信息量的知识约简的启发式算法,该算法的时间复杂性为O(｜R｜3｜U｜2)。通过例子分析,表明该算法是有效的。更多还原

【Abstract】 Rough set theory is a new mathematical tool to deal with vagueness and uncertainty.Attribute reduction is one of the important topics in the research on rough set theory.It has been proved that finding the minimal reduction of an information system is a NP-hard problem.In this paper,an absolute information quantity-based heuristic algorithm for reduction of knowledge is proposed,the time complexity of this algorithm is O(｜R｜ 3 ｜U｜ 2 ).Through running an example,it show s that this algorithm is effective.更多还原