首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Rough Class on a Completely Distributive Lattice
作者姓名:陈德刚  张文修  宋士吉
作者单位:Department of Automation,Tsinghua University,Beijing 100084,China,Institute for Information and System Science,Xi’an Jiaotong University,Xi’an 710049,China,Department of Automation,Tsinghua University,Beijing 100084,China
基金项目:Supported by the National Natural Science Foundation of China(No.60074015)
摘    要:This paper generalizes the Pawlak rough set method to a completely distributive lattice. The concept of a rough set has many applications in data mining. The approximation operators on a completely distributive lattice are studied, the rough class on a completely distributive lattice is defined and the expressional theorems of the rough class are proven. These expressional theorems are used to prove that the collection of all rough classes is an atomic completely distributive lattice.


Rough Class on a Completely Distributive Lattice
CHEN Degang,ZHANG Wenxiu,SONG Shiji.Rough Class on a Completely Distributive Lattice[J].Tsinghua Science and Technology,2003,8(2).
Authors:CHEN Degang  ZHANG Wenxiu  SONG Shiji
Institution:CHEN Degang,ZHANG Wenxiu,SONG Shiji Department of Automation,Tsinghua University,Beijing 100084,China, t Institute for Information and System Science,Xi'an Jiaotong University,Xi'an 710049,China
Abstract:This paper generalizes the Pawlak rough set method to a completely distributive lattice. The concept of a rough set has many applications in data mining. The approximation operators on a completely distributive lattice are studied, the rough class on a completely distributive lattice is defined and the expressional theorems of the rough class are proven. These expressional theorems are used to prove that the collection of all rough classes is an atomic completely distributive lattice.
Keywords:rough sets  completely distributive lattice  rough class
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号