DeepAI AI Chat
Log In Sign Up

Incremental Computation of Concept Diagrams

03/06/2019
by   Francesco Kriegel, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/14/2021

Boolean Substructures in Formal Concept Analysis

It is known that a (concept) lattice contains an n-dimensional Boolean s...
11/15/2017

Note on Representing attribute reduction and concepts in concepts lattice using graphs

Mao H. (2017, Representing attribute reduction and concepts in concept l...
07/28/2016

Incremental Noising and its Fractal Behavior

This manuscript is about further elucidating the concept of noising. The...
06/21/2021

Attribute Selection using Contranominal Scales

Formal Concept Analysis (FCA) allows to analyze binary data by deriving ...
07/11/2023

Mining for Unknown Unknowns

Unknown unknowns are future relevant contingencies that lack an ex ante ...
09/09/2011

Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis

We present a novel approach to the automatic acquisition of taxonomies o...
01/08/2020

Estimating Tukey Depth Using Incremental Quantile Estimators

The concept of depth represents methods to measure how deep an arbitrary...