A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
From MaRDI portal
Publication:1870542
DOI10.1016/S0304-3975(02)00183-4zbMath1026.68035MaRDI 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
68P15: Database theory
68W05: Nonnumerical algorithms
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Improved time complexities for learning Boolean networks, Bayesian state space models for dynamic genetic network construction across multiple tissues, Performance analysis of a greedy algorithm for inferring Boolean functions, An efficient top-down search algorithm for learning Boolean networks of gene expression
Uses Software
Cites Work