约简与核是粗糙集理论的两个重要概念,而直接由定义来计算约简与核是一个典型的NP难题。
Reduction and core are two important concepts in rough set theory, while computing reductions and core according to the definitions directly is a typical NP problem.
本文试图寻找这个均衡解集的中心核。
以原始条件属性集为起点并结合算子,通过向属性核的递减式逼近,得到属性的最小相对约简。
Acquiring optimal relative reduction by descending approach to core of attribute from original set of conditional attribute and combining with operator.
应用推荐