Pages that link to "Item:Q4269815"
From MaRDI portal
The following pages link to Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies (Q4269815):
Displaying 28 items.
- TANE (Q14740) (← links)
- Improved time complexities for learning Boolean networks (Q280576) (← links)
- Mining approximate interval-based temporal dependencies (Q329410) (← links)
- RQL: a query language for rule discovery in databases (Q507529) (← links)
- Reformulating table constraints using functional dependencies-an application to explanation generation (Q941813) (← links)
- Discovery of functional and approximate functional dependencies in relational databases (Q1430410) (← links)
- Fast algorithms of mining probability functional dependency rules in relational database (Q1579732) (← links)
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures (Q1800380) (← links)
- A note on approximation measures for multi-valued dependencies in relational databases (Q1853694) (← links)
- A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis (Q1870542) (← links)
- Reducing one class of machine learning algorithms to logical operations of plausible reasoning (Q2017512) (← links)
- Approximate keys and functional dependencies in incomplete databases with limited domains (Q2103914) (← links)
- Mining relaxed functional dependencies from data (Q2218413) (← links)
- Characterizing functional dependencies in formal concept analysis with pattern structures (Q2254619) (← links)
- Functional dependencies are helpful for partial materialization of data cubes (Q2254643) (← links)
- Erratum to ``Reformulating table constraints using functional dependencies---an application to explanation generation'' (Q2267809) (← links)
- Link key candidate extraction with relational concept analysis (Q2286378) (← links)
- Towards a Scalable Query Rewriting Algorithm in Presence of Value Constraints (Q3638226) (← links)
- Functional and approximate dependency mining: database and FCA points of view (Q4409019) (← links)
- Discovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey (Q4969627) (← links)
- Checking Sets of Pure Evolving Association Rules (Q4991927) (← links)
- Analysis of fuzzy -ary relations with the use of interval-valued fuzzy functional dependencies (Q5326156) (← links)
- Using Transversals for Discovering XML Functional Dependencies (Q5445302) (← links)
- Database repairing with soft functional dependencies (Q6536405) (← links)
- Mining frequent itemsets: a perspective from operations research (Q6573277) (← links)
- Non-blocking functional dependency discovery from data streams (Q6645026) (← links)
- Predictive mining of multi-temporal relations (Q6647763) (← links)
