Formal Methods in FCA and Big Data
From MaRDI portal
Publication:5054986
DOI10.1007/978-3-030-93278-7_9OpenAlexW4302595828MaRDI QIDQ5054986
Emilio Muñoz-Velasco, Domingo López-Rodríguez, Manuel Ojeda Aciego
Publication date: 12 December 2022
Published in: Complex Data Analytics with Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-93278-7_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
- On the complexity of enumerating pseudo-intents
- On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
- Attribute reduction theory and approach to concept lattice
- The multiple facets of the canonical direct unit implicational basis
- Attribute reduction in formal contexts based on a new discernibility matrix
- Direct-optimal basis computation by means of the fusion of simplification rules
- Inferring minimal functional dependencies in Horn and q-Horn theories
- Ordered direct implicational basis of a finite closure system
- Computing premises of a minimal cover of functional dependencies is intractable
- Model selection based on minimum description length
- On interestingness measures of formal concepts
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
- On attribute reduction in concept lattices: the polynomial time discernibility matrix-based method becomes the CR-method
- Knowledge reduction in formal contexts using non-negative matrix factorization
- Queries and concept learning
- Canonical dichotomous direct bases
- Explanation in artificial intelligence: insights from the social sciences
- On the usability of probably approximately correct implication bases
- Closure-based constraints in formal concept analysis
- Selecting Important Concepts Using Weights
- Hardness of Enumerating Pseudo-intents in the Lectic Order
- Using FCA for Encoding Closure Operators into Neural Networks
- Rough sets
- Computing iceberg concept lattices with Titanic
- Closure via functional dependence simplification
- Attribute Reduction in Rough Set Theory and Formal Concept Analysis
- Formal Concept Analysis with Constraints by Closure Operators
- Automated prover for attribute dependencies in data with grades
This page was built for publication: Formal Methods in FCA and Big Data
