Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
From MaRDI portal
Recommendations
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Functional and approximate dependency mining: database and FCA points of view
- Efficient discovery of functional dependencies with degrees of satisfaction
- Formal Concept Analysis
- A definition for fuzzy approximate dependencies
Cites work
- scientific article; zbMATH DE number 1700021 (Why is no real title available?)
- 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?)
- A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Comparing performance of algorithms for generating concept lattices
- Conditional functional dependencies: an FCA point of view
- Foundations of data quality management
- Functional and approximate dependency mining: database and FCA points of view
- Galois connections in data analysis: Contributions from the Soviet era and modern Russian research
- Impurity measures in databases
- Normalization and axiomatization for numerical dependencies
- On the Structure of Armstrong Relations for Functional Dependencies
- Ordered functional dependencies in relational databases
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Unifying framework for rule semantics: application to gene expression data
Cited in
(10)- Knowledge implications in multi-adjoint concept lattices
- Matching dependencies: semantics and query answering
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Towards declarative comparabilities: application to functional dependencies
- Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset
- Functional and approximate dependency mining: database and FCA points of view
- Conjunctive query pattern structures: a relational database model for formal concept analysis
- Data cleaning and query answering with matching dependencies and matching functions
- Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts
- Computing Dependencies Using FCA
This page was built for publication: Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1800380)
