# Incremental Computation of Concept Diagrams

## TL;DR

This paper presents an incremental algorithm for updating concept diagrams in formal concept analysis when attributes are added or removed, improving efficiency in dynamic data environments.

## Contribution

It introduces and proves a novel incremental update method for concept diagrams, enabling efficient modifications in formal concept analysis.

## Key findings

- Efficient incremental update algorithm for concept diagrams.
- Proven correctness of the algorithm.
- Applicable to dynamic data scenarios.

## 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.

---
Source: https://tomesphere.com/paper/1903.02593