论文部分内容阅读
This paper generalizes the Pawlak rough set method to a completely distributive lattice. Theconcept of a rough set has many applications in data mining. The approximation operators on a completelydistributive lattice are studied, the rough class on a completely distributive lattice is defined and theexpressional theorems of the rough class are proven. These expressional theorems are used to prove that thecollection of all rough classes is an atomic completely distributive lattice.