Concept stability was used in numerous applications for selecting concepts as biclusters of similar objects. However, scalability remains a challenge for computing stability. The best algorithmsâ€¦ (More)

The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizingâ€¦ (More)

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 values to the set of its maximal 0 values. In this paper we consider finiteâ€¦ (More)

Any monotone Boolean function on a lattice can be described by the set of its minimal 1 values. If a lattice is given as a concept lattice, this set can be represented by the set of minimalâ€¦ (More)

Several notions of links between contexts â€“ intensionally related concepts, shared intents, and bonds, as well as interrelations thereof â€“ are considered. Algorithmic complexity of the problemsâ€¦ (More)