A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
From MaRDI portal
(Redirected from Publication:1870542)
Recommendations
- Approximate inference of functional dependencies from relations
- Algorithms for inferring functional dependencies from relations
- AN ALGORITHM FOR FINDING ALL FUNCTIONS EMBEDDED IN A RELATION
- Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
- scientific article; zbMATH DE number 2080473
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Approximation algorithms for combinatorial problems
- Matrix multiplication via arithmetic progressions
- Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation.
- On the complexity of inferring functional dependencies
Cited in
(5)- AN ALGORITHM FOR FINDING ALL FUNCTIONS EMBEDDED IN A RELATION
- Performance analysis of a greedy algorithm for inferring Boolean functions
- Improved time complexities for learning Boolean networks
- An efficient top-down search algorithm for learning Boolean networks of gene expression
- Bayesian state space models for dynamic genetic network construction across multiple tissues
This page was built for publication: A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870542)