Functional and approximate dependency mining: database and FCA points of view
From MaRDI portal
Publication:4409019
Recommendations
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Approximate inference of functional dependencies from relations
- Functional and embedded dependency inference: A data mining point of view
- A method for mining functional dependencies in relational database design using FCA
Cites work
- A fast algorithm for building lattices
- Algorithms for inferring functional dependencies from relations
- Approximate inference of functional dependencies from relations
- Decompositions and functional dependencies in relations
- Design by example: An application of Armstrong relations
- Discovering functional and inclusion dependencies in relational databases
- Functional and embedded dependency inference: A data mining point of view
- Functional dependencies in relational databases: A lattice point of view
- scientific article; zbMATH DE number 1670911 (Why is no real title available?)
- scientific article; zbMATH DE number 108405 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1294230 (Why is no real title available?)
- scientific article; zbMATH DE number 1755716 (Why is no real title available?)
- scientific article; zbMATH DE number 1882061 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Minimum Covers in Relational Database Model
- Partition semantics for relations
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
Cited in
(22)- Impurity measures in databases
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
- Approximate keys and functional dependencies in incomplete databases with limited domains
- Mining relaxed functional dependencies from data
- Characterizing functional dependencies in formal concept analysis with pattern structures
- Link key candidate extraction with relational concept analysis
- Implication and functional dependency in intensional contexts
- The agree concept lattice for multidimensional database analysis
- Mining approximate interval-based temporal dependencies
- A formal context for acyclic join dependencies
- Conditional functional dependencies: an FCA point of view
- A Unified Hierarchy for Functional Dependencies, Conditional Functional Dependencies and Association Rules
- A software tool for data analysis based on formal concept analysis
- The mathematical mechanism of functional dependency and its deformation in the view of data mining
- Computing Dependencies Using FCA
- RQL: a query language for rule discovery in databases
- A method for mining functional dependencies in relational database design using FCA
- Functional and embedded dependency inference: A data mining point of view
- Three views on dependency covers from an FCA perspective
- Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
- Approximate inference of functional dependencies from relations
- Approximate integrity constraints in incomplete databases with limited domains
This page was built for publication: Functional and approximate dependency mining: database and FCA points of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409019)
