Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
From MaRDI portal
Publication:1800380
DOI10.1016/j.dam.2018.03.073zbMath1398.68508OpenAlexW2795433931MaRDI QIDQ1800380
Jaume Baixeries, Amedeo Napoli, Victor Codocedo, Mehdi Kaytoue
Publication date: 23 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/117479
similarityformal concept analysisfunctional dependenciestolerance relationattribute implicationspattern structures
Related Items
Computing Dependencies Using FCA ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Disjunctive attribute dependencies in formal concept analysis under the epistemic view of formal contexts ⋮ Knowledge implications in multi-adjoint concept lattices
Uses Software
Cites Work
- Impurity measures in databases
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Ordered functional dependencies in relational databases
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Foundations of Data Quality Management
- Conditional Functional Dependencies: An FCA Point of View
- A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules
- Normalization and axiomatization for numerical dependencies
- On the Structure of Armstrong Relations for Functional Dependencies
- THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Functional and approximate dependency mining: database and FCA points of view
- Comparing performance of algorithms for generating concept lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
