Functional and embedded dependency inference: A data mining point of view
From MaRDI portal
Recommendations
- FUN: An efficient algorithm for mining functional and embedded dependencies
- FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. extended abstract
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Functional and approximate dependency mining: database and FCA points of view
- scientific article; zbMATH DE number 2101217
Cited in
(14)- Discovery of functional and approximate functional dependencies in relational databases
- Fast algorithms of mining probability functional dependency rules in relational database
- A note on approximation measures for multi-valued dependencies in relational databases
- Mining relaxed functional dependencies from data
- Exploiting domain knowledge to detect outliers
- Non-deterministic ideal operators: an adequate tool for formalization in data bases
- The agree concept lattice for multidimensional database analysis
- Efficient algorithms for mining inclusion dependencies
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- Functional and approximate dependency mining: database and FCA points of view
- FUN: An efficient algorithm for mining functional and embedded dependencies
- FastFDs: A heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances. extended abstract
- Automatic extraction of functional dependencies
- Non-blocking functional dependency discovery from data streams
This page was built for publication: Functional and embedded dependency inference: A data mining point of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5953901)