Closure-based constraints in formal concept analysis

DOI10.1016/J.DAM.2013.02.029MaRDI QIDQ2446833zbMATH OpenOpenAlexFDO

Authors Vilem Vychodil, Radim Belohlavek

Publication date 22 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.02.029

zbMATH Keywords

algorithmsattribute implicationbackground knowledgebinary relationclosure structureformal concept analysis

Mathematics Subject Classification ID

Galois correspondences, closure operators (in relation to ordered sets) (06A15) Knowledge representation (68T30)

Recommendations

• Formal Concept Analysis with Constraints by Closure Operators
• Formal Concept Analysis
• Formal Concept Analysis with Constraints by EM Operators
• scientific article; zbMATH DE number 1670908
• Concept Lattices
• A possibility-theoretic view of formal concept analysis
• Formal concept analysis from the standpoint of possibility theory
• Closure properties of constraints

Cites work

• Association rule mining. Models and algorithms
• Attribute exploration with background knowledge
• Comparing performance of algorithms for generating concept lattices
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 3604894 (Why is no real title available?)
• scientific article; zbMATH DE number 1257634 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 2168560 (Why is no real title available?)
• scientific article; zbMATH DE number 7635224 (Why is no real title available?)
• On generating all maximal independent sets
• On the intractability of computing the Duquenne-Guigues base
• Pseudo-models and propositional Horn inference

Cited in

(15)

• Constraints, consistency and closure
• On biconcepts in formal fuzzy concept analysis
• A methodology for analysis of concept lattice reduction
• Rules acquisition of formal decision contexts based on three-way concept lattices
• Constrained closed datacubes
• Two basic algorithms in concept analysis
• Closed patterns and abstraction beyond lattices
• Computing Dependencies Using FCA
• Formal Methods in FCA and Big Data
• Formal Concept Analysis with Constraints by EM Operators
• Extensional confluences and local closure operators
• Formal Concept Analysis
• Formal Concept Analysis with Constraints by Closure Operators
• LinCbO: fast algorithm for computation of the Duquenne-Guigues basis
• Pruning techniques in lincbo for the computation of the duquenne-guigues basis

This page was built for publication: Closure-based constraints in formal concept analysis

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