Date Added: Sep 2010
Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. Rough approximations on a Complete Completely Distributive lattice (CCD lattice for short) and brings generalizations of rough sets into a unified framework are discussed. 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; and conversely, a clopen topology which obey disjoint axiom can be induced by approximations.