An Incremental Algorithm for Computing n-Dimensional Concepts
Abstract
The problem of computing maximal rectangles (concepts) from a binary relation (context) has received much attention. The same cannot be said of the general, n-dimensional case. In this work, we propose the first output-polynomial incremental algorithm for computing the n-concepts of an n-context.
Origin : Files produced by the author(s)
Loading...