基于分类知识结构的最小约简算法

摘要

By using the structural characteristic of data classification knowledge in knowledge base,we determine the lower bound of minimal reduction solution to be searched;by combining the feasible solution derived from heuristic reduction algorithm as the upper bound of search,the search region of minimal reduction solution,which has been greatly narrowed,is able to be got.By optimising the search algorithm within the region,we rapidly obtain the solution set of minimal reduction of dataset.It is proved by the examples that this algorithm is simple in operation approach and is effective as well,it provides the reference for the algorithms research in regard to obtaining minimal reduction solutions.%运用知识库系统中数据分类知识的结构性特点，确定搜索最小约简解的下界；结合启发式约简算法获得的可行解为搜索上界，则可获得大大缩小的最小约简解搜索区间。在区间内优化搜索算法，快速地获得了数据集的最小约简解集。实例证明该运算途径简易、有效，为获取最小约简解的算法研究提供了参考。