On Decomposition of a Binary Context Without Losing Formal Concepts

DOI10.17516/1997-1397-2019-12-3-323-330MaRDI QIDQ5853395zbMATH OpenOpenAlexFDO

Authors Choduraa M. Mongush, Valentina Vladimirovna Bykova

Publication date 18 March 2021

Published in Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/jsfu764

zbMATH Keywords

decomposition of binary contextformal concept analysis

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Recommendations

• Decompositional approach to research of formal contexts
• Using fringes for minimal conceptual decomposition of binary contexts
• On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts
• On computing the size of a lattice and related decision problems
• Computing formal concepts by attribute sorting

Cites work

• A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
• Comparing performance of algorithms for generating concept lattices
• Conceptual exploration
• scientific article; zbMATH DE number 877297 (Why is no real title available?)
• Mathematical methods for the analysis of recursive algorithms
• On Algebraic Approach of R. Wille and B. Ganter in the Investigation of Texts
• Ordered sets

Cited in

(1)

• Using fringes for minimal conceptual decomposition of binary contexts

This page was built for publication: On Decomposition of a Binary Context Without Losing Formal Concepts

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