DeepAI AI Chat

Incremental Computation of Concept Diagrams

03/06/2019

∙

by Francesco Kriegel, et al.

∙

∙

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.

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

0 Maren Koyda, et al. ∙

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

0 Jan Konecny, et al. ∙

∙ 07/28/2016

Incremental Noising and its Fractal Behavior

This manuscript is about further elucidating the concept of noising. The...

0 Konstantinos A. Raftopoulos, et al. ∙

∙ 06/21/2021

Attribute Selection using Contranominal Scales

Formal Concept Analysis (FCA) allows to analyze binary data by deriving ...

0 Dominik Dürrschnabel, et al. ∙

∙ 07/11/2023

Mining for Unknown Unknowns

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

0 Bernard Sinclair-Desgagné, et al. ∙

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

0 P. Cimiano, et al. ∙

∙ 01/08/2020

Estimating Tukey Depth Using Incremental Quantile Estimators

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

0 Hugo Lewi Hammer, et al. ∙