Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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 metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01653717
Contributor : Giacomo Kahn Connect in order to contact the contributor
Submitted on : Friday, December 1, 2017 - 5:51:14 PM
Last modification on : Sunday, June 26, 2022 - 9:37:56 AM

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

333

Files downloads

68