A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
DOI10.1016/S0304-3975(02)00183-4zbMATH Open1026.68035OpenAlexW2090143015MaRDI QIDQ1870542FDOQ1870542
Authors: Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara 
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00183-4
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
Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05) Database theory (68P15)
Cites Work
- Approximation algorithms for combinatorial problems
- Title not available (Why is that?)
- Matrix multiplication via arithmetic progressions
- On the complexity of inferring functional dependencies
- Title not available (Why is that?)
- Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation.
Cited In (5)
- 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
- AN ALGORITHM FOR FINDING ALL FUNCTIONS EMBEDDED IN A RELATION
Uses Software
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)
