Home > Table of Contents


Proceedings of the 2nd International Symposium on Information Processing (ISIP 2009)

Huangshan, China, August 21-23, 2009

Editors: Fei Yu, Jian Shu, and Guangxue Yue

AP Catalog Number: AP-PROC-CS-09CN002

ISBN: 978-952-5726-02-2 (Print), 978-952-5726-03-9 (CD-ROM)

Page(s): 93-96

The Topological Structure of Approximation Operators on a CCD Lattice

Gao Yan, Du Weifeng, Yang Jilin, and Qin Keyun

Full text: PDF


Rough sets deal with the vagueness and granularity in information systems. Reference[3] discusses rough approximations on a complete completely distributive lattice (CCD lattice for short) and brings generalizations of rough sets into a unified framework. This paper is devoted to the discussion of the relationship between approximations and topologies on a CCD lattice. It is proved that the set of all upper approximations (or of lower approximations) with respect to a partition consists of a clopen topology.

Index Terms

Rough sets, Complete Completely DistributiveLattice, Approximations, Clopen Topology

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved