摘要
研究了求信息系统最小约简的完备方法.根据信息系统的对象在某个属性上取值的不同,将信息系统划分为若干子系统,分析并证明了原系统的最小约简与基于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.
出处
《武汉大学学报（理学版）》
CAS
CSCD
北大核心
2005年第3期269-272,共4页
Journal of Wuhan University:Natural Science Edition
基金
国家重大基础研究前期研究专项基金(2003CCA00200)
国家自然科学基金重大研究项目(90104005)
湖北省自然科学基金资助项目(201130485)
关键词
划分子系统
最小约简
粗糙集
属性约简
信息系统
partition sub-system
smallest reduction
rough set
attribute reduction
information system
