摘要
约简是粗糙集用于数据分析的重要方法和手段,也是粗糙集理论的核心内容之一.论域U上的等价关系可以确定U的划分,U上的不可区分关系是等价关系.利用不可区分关系定义信息系统的划分协调集及划分约简集,而且证明了划分约简集的判定定理,并将其应用于实际分类问题.
Reduction is an important method of applying rough set to analyze datum, and is one of core contents of rough set theory. The partition of range U is defined by equivalence relations in range U. The indiscernibility relation in range U is equivalence relation. The partition consistent set and partition reduction set of information system is defined by the indiscernibility relations. The determination theorem of partition reduction set is proved, and we apply the theorem to practical classification problem.
出处
《数学的实践与认识》
CSCD
北大核心
2008年第9期107-114,共8页
Mathematics in Practice and Theory
基金
河南省科技厅基金资助项目(0413031920)
河南省教育厅基金资助项目(04922022)
关键词
属性约简
不可区分关系
信息系统
划分约简集
划分区分矩阵
reduction of attributes
indiscernibility relation
information system
partition reduction set
partition discernibility matrx