An Incremental Algorithm for Computing n-Dimensional Concepts - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

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.
Fichier principal
Vignette du fichier
NCremental.pdf (337.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01653717 , version 1 (01-12-2017)

Identifiers

  • HAL Id : hal-01653717 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More