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.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01653717
Contributor : Giacomo Kahn <>
Submitted on : Friday, December 1, 2017 - 5:51:14 PM
Last modification on : Monday, January 20, 2020 - 12:14:05 PM

File

NCremental.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01653717, version 1

Citation

Alexandre Bazin, Giacomo Kahn, Olivier Raynaud. An Incremental Algorithm for Computing n-Dimensional Concepts. 2017. ⟨hal-01653717⟩

Share

Metrics

Record views

425

Files downloads

96