On some complexity aspects of generalized one-sided concept lattices algorithm

Abstract

In this paper we provide some complexity aspects of incremental algorithm for creation of generalized one-sided concept lattices. The novelty of this algorithm is in its possibility to work with different types of attributes and produce one-sided concept lattice from the generalized one-sided formal context. As it is shown in the paper, the complexity of the algorithm is in general exponential. However, in practice it is reasonable to consider special cases, where the number of attributes is fixed. Then complexity of presented algorithm asymptotically becomes linear function depending on the number of objects in formal context.