Classification trees in a box extent lattice

DOI10.13164/MA.2017.06MaRDI QIDQ5365582zbMATH OpenOpenAlexFDO

Authors Laura Veres

Publication date 6 October 2017

Published in Mathematics for Application (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.05109

zbMATH Keywords

box extentclassification treeconcept latticeextent partitionone-object extension

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Complete lattices, completions (06B23) Knowledge representation (68T30)

Abstract: In this paper we show that during an elementary extension of a context each of the classification trees of the newly created box extent lattice can be obtained by the modification of the classification trees of the box extent lattice of the original, smaller context. We construct also an algorithm which, starting from a classification tree of the box extent lattice of the smaller context $(H,M,IcapHimesM),$ gives a classification tree of the extended context $(G,M,I)$ which contains the new elements inserted. The effectiveness of the method is that it ensures that there is enough to know the original context, the classification tree of the box extent lattice and its box extents, we do not need a new box extension of the extended context mesh elements (except for one, which is the new element box extension).

Recommendations

• An incremental method for the construction of the box extents of a context
• Extent partitions and context extensions.
• Trees in Concept Lattices
• CHARACTERIZING TREES IN CONCEPT LATTICES
• Classification systems and their lattice

Cited in

(3)

• An incremental method for the construction of the box extents of a context
• scientific article; zbMATH DE number 5026365 (Why is no real title available?)
• Extent partitions and context extensions.

This page was built for publication: Classification trees in a box extent lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365582)