Classification and reduction of attributes in concept lattices

Abstract

In this paper we investigate the attribute classifica- tion and the reduction of concept lattices within the framework of rough set theory. Based on the binary relation between objects and attributes in a formal context, the properties of the irre- ducible elements on extent closure systems and the congruence on semi-lattices are discussed. Two kinds of classification methods for attributes by means of the properties are proposed. Using the classification, the reducts of concept lattices can be derived.