摘要
在数据元素间不存在等价关系而存在覆盖关系的情况下,应用覆盖的交定义了两种覆盖粗糙集模型.采用比较的方法讨论了两种覆盖粗糙集模型中上、下近似算子的性质,并利用数学理论证明了相应观点的正确性.通过分析明确了两种覆盖粗糙集模型中上、下近似算子之间以及它们与其它粗糙集模型上、下近似算子之间的关系.通过这些研究,扩展了粗糙集理论,补充了知识发现理论与方法,为大型数据库的数据挖掘提供了一个简单的途径.
By means of intersection of covering, two kinds of covering rough set models are defined in the case of absence of equivalence relations in addition to covering relations between the data elements. The properties of lower approximation operator and upper approximation operator are discussed by using comparable methods in two covering rough set model, and the correctness of the corresponding point is proved by using mathemati- cal theory. Through analysis of the definitions of two kinds of covering rough set models, the relationships of the lower approximation operator and upper approximation operator and with other rough set models are illustra- ted. Through these researches, the rough set theory is expanded, the theory and method of knowledge discov- ery is improved, and a simple way is provided for data mining of large databases.
出处
《郑州大学学报(工学版)》
CAS
北大核心
2014年第4期109-111,共3页
Journal of Zhengzhou University(Engineering Science)
基金
河南省重点科技攻关计划资助项目(122102210487)
河南省国际科技合作计划资助项目(124300510040)
洛阳市科技发展计划项目(1301008A
1301034A)
关键词
覆盖
下近似算子
上近似算子
知识发现
cover
lower approximation operator
upper approximation operator
knowledge discovery