基于U/{a}划分的最小约简构造

U/{a} Partition Based Smallest Reduction Construction

研究了求信息系统最小约简的完备方法.根据信息系统的对象在某个属性上取值的不同,将信息系统划分为若干子系统,分析并证明了原系统的最小约简与基于U/{a}划分的各子系统约简之间的关系,并在此基础上提出了一种基于U/{a}划分子系统的最小约简构造方法,选用UCI的zoo数据集,通过实验验证了该方法.

In this paper, information system is divided into a number of sub-systems based on the different attribution values of information system object, and the relation between the smallest reduction of original system and the attribution reduction of sub-systems is analyzed and established. On the basis of the established relation, a method which is used to reconstruct the original system’s shortest reduction from sub-system’s reduction is proposed. A smallest reduction construction experiment with the zoo dataset of UCI is conducted and the results show that the method is efficient and feasible in practice.