Functional and approximate dependency mining: database and FCA points of view
From MaRDI portal
Publication:4409019
DOI10.1080/09528130210164143zbMath1024.68027OpenAlexW1965280952MaRDI QIDQ4409019
Stéphane Lopes, Lotfi Lakhal, Jean-Marc Petit
Publication date: 29 June 2003
Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09528130210164143
Related Items (8)
Computing Dependencies Using FCA ⋮ The Agree Concept Lattice for Multidimensional Database Analysis ⋮ RQL: a query language for rule discovery in databases ⋮ Characterizing functional dependencies in formal concept analysis with pattern structures ⋮ Link key candidate extraction with relational concept analysis ⋮ Characterizing approximate-matching dependencies in formal concept analysis with pattern structures ⋮ A Formal Context for Acyclic Join Dependencies ⋮ Approximate keys and functional dependencies in incomplete databases with limited domains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partition semantics for relations
- Design by example: An application of Armstrong relations
- Approximate inference of functional dependencies from relations
- Functional dependencies in relational databases: A lattice point of view
- A fast algorithm for building lattices
- Decompositions and functional dependencies in relations
- Minimum Covers in Relational Database Model
- Discovering functional and inclusion dependencies in relational databases
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Algorithms for inferring functional dependencies from relations
- Functional and embedded dependency inference: A data mining point of view
This page was built for publication: Functional and approximate dependency mining: database and FCA points of view
