Incremental Computation of Concept Diagrams
Research output: Contribution to book/conference proceedings/anthology/report › Conference contribution › Contributed › peer-review
Contributors
Abstract
Suppose a formal context 𝕂=(G,M,I) is given, whose concept lattice 𝕭(𝕂) with an attribute-additive concept diagram is already known, and an attribute column ℂ=(G,{n},J) shall be inserted to or removed from it. This paper introduces and proves an incremental update algorithm for both tasks.
Details
| Original language | English |
|---|---|
| Title of host publication | Supplemental proceedings of the 12th International Conference on Formal Concept Analysis (ICFCA 2014), Cluj-Napoca, Romania |
| Pages | 45-61 |
| Number of pages | 17 |
| Publication status | Published - 10 Jun 2014 |
| Peer-reviewed | Yes |
External IDs
| ORCID | /0000-0003-0219-0330/work/153109409 |
|---|