Covering-Based Reduction of Object-Oriented Concept Lattices

摘要

To be an efficient tool for knowledge expression and analysis, formal concept analysis has been paid more attention to in recent years. For the object-oriented concept lattice of a formal context, this paper proposes two compression methods to reduce the original lattice based on covering of the object (attribute) set. We firstly introduce the similarity degree and the neighborhood of an object (attribute) set, and then obtain the covering of the object (attribute) set. Based on which, the object-oriented concept lattice can be compressed into a smaller one through adjusting the object (attribute) neighborhood's size by the similarity degree, and the reduced lattice is a subset of the original one.