Incremental Computation of Concept Diagrams
Logic in Computer Science
2019-03-08 v1
Abstract
Suppose a formal context K=(G,M,I) is given, whose concept lattice B(K) with an attribute-additive concept diagram is already known, and an attribute column C=(G,{n},J) shall be inserted to or removed from it. This paper introduces and proves an incremental update algorithm for both tasks.
Keywords
Cite
@article{arxiv.1903.02593,
title = {Incremental Computation of Concept Diagrams},
author = {Francesco Kriegel},
journal= {arXiv preprint arXiv:1903.02593},
year = {2019}
}
Comments
Supplemental proceedings of the 12th International Conference on Formal Concept Analysis (ICFCA 2014), Cluj-Napoca, Romania