Formal Methods in FCA and Big Data
From MaRDI portal
Recommendations
Cites work
- Attribute reduction in formal contexts based on a new discernibility matrix
- Attribute reduction in rough set theory and formal concept analysis
- Attribute reduction theory and approach to concept lattice
- Automated prover for attribute dependencies in data with grades
- Canonical dichotomous direct bases
- Closure via functional dependence simplification
- Closure-based constraints in formal concept analysis
- Computing iceberg concept lattices with Titanic
- Computing implications with negation from a formal context
- Computing premises of a minimal cover of functional dependencies is intractable
- Direct-optimal basis computation by means of the fusion of simplification rules
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Explanation in artificial intelligence: insights from the social sciences
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
- Formal Concept Analysis with Constraints by Closure Operators
- Hardness of enumerating pseudo-intents in the lectic order
- scientific article; zbMATH DE number 1696848 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 108396 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1974020 (Why is no real title available?)
- scientific article; zbMATH DE number 2016086 (Why is no real title available?)
- scientific article; zbMATH DE number 2159643 (Why is no real title available?)
- scientific article; zbMATH DE number 861622 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- Inferring minimal functional dependencies in Horn and q-Horn theories
- Knowledge reduction in formal contexts using non-negative matrix factorization
- Model selection based on minimum description length
- On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
- On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method
- On interestingness measures of formal concepts
- On the complexity of enumerating pseudo-intents
- On the intractability of computing the Duquenne-Guigues base
- On the usability of probably approximately correct implication bases
- Ordered direct implicational basis of a finite closure system
- Queries and concept learning
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- Rough sets
- Selecting important concepts using weights
- The multiple facets of the canonical direct unit implicational basis
- Using FCA for Encoding Closure Operators into Neural Networks
Cited in
(5)
This page was built for publication: Formal Methods in FCA and Big Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054986)
