A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis

DOI10.1016/S0304-3975(02)00183-4zbMath1026.68035OpenAlexW2090143015MaRDI QIDQ1870542

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

zbMATH Keywords

greedy algorithmknowledge discoveryaverage case analysisfunctional dependenciesset cover

Mathematics Subject Classification ID

Database theory (68P15) Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Improved time complexities for learning Boolean networks ⋮ Performance analysis of a greedy algorithm for inferring Boolean functions ⋮ Bayesian state space models for dynamic genetic network construction across multiple tissues ⋮ An efficient top-down search algorithm for learning Boolean networks of gene expression

Uses Software

• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation.
• On the complexity of inferring functional dependencies
• Approximation algorithms for combinatorial problems

This page was built for publication: A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis