Computing Dependencies Using FCA
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1808289 (Why is no real title available?)
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- scientific article; zbMATH DE number 168431 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 7635224 (Why is no real title available?)
- A Formal Context for Symmetric Dependencies
- A formal context for acyclic join dependencies
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Conditional functional dependencies: an FCA point of view
- Constraint-generating dependencies
- Data cleaning and query answering with matching dependencies and matching functions
- Formal Concept Analysis
- Functional and approximate dependency mining: database and FCA points of view
- Machine learning on the basis of formal concept analysis
- Mining relaxed functional dependencies from data
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Why can concept lattices support knowledge discovery in databases?
This page was built for publication: Computing Dependencies Using FCA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054980)