Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
From MaRDI portal
Recommendations
Cited in
(35)- A note on approximation measures for multi-valued dependencies in relational databases
- A proposal of the sub-attributes based \(\beta \)-dependency in rough sets and its calculation
- Approximate keys and functional dependencies in incomplete databases with limited domains
- Mining relaxed functional dependencies from data
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
- Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints
- Mining frequent itemsets: a perspective from operations research
- Improved time complexities for learning Boolean networks
- Database repairing with soft functional dependencies
- Using Transversals for Discovering XML Functional Dependencies
- Reducing one class of machine learning algorithms to logical operations of plausible reasoning
- Discovery of functional and approximate functional dependencies in relational databases
- Consideration of detecting data and functional dependency in tabular data with missing values by the obtained rules
- Functional dependencies are helpful for partial materialization of data cubes
- Characterizing functional dependencies in formal concept analysis with pattern structures
- TANE
- Mining approximate interval-based temporal dependencies
- Erratum to ``Reformulating table constraints using functional dependencies---an application to explanation generation
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
- scientific article; zbMATH DE number 1755716 (Why is no real title available?)
- Analysis of fuzzy \(n\)-ary relations with the use of interval-valued fuzzy functional dependencies
- Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey
- scientific article; zbMATH DE number 2080473 (Why is no real title available?)
- Functional and approximate dependency mining: database and FCA points of view
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
- Non-blocking functional dependency discovery from data streams
- Predictive mining of multi-temporal relations
- Checking sets of pure evolving association rules
- Approximate integrity constraints in incomplete databases with limited domains
- Functional and embedded dependency inference: A data mining point of view
- RQL: a query language for rule discovery in databases
- Fast algorithms of mining probability functional dependency rules in relational database
- Link key candidate extraction with relational concept analysis
- Reformulating table constraints using functional dependencies-an application to explanation generation
- Database repairing with soft functional dependencies
This page was built for publication: Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4269815)
