Incremental Computation of Concept Diagrams
Francesco Kriegel
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.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Semantic Web and Ontologies · Data Management and Algorithms