Performance analysis of a greedy algorithm for inferring Boolean functions

DOI10.1016/j.ipl.2004.09.017zbMath1173.68884OpenAlexW1966950943MaRDI QIDQ834975

Tatsuya Akutsu, Daiji Fukagawa

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.017

zbMATH Keywords

analysis of algorithmsuniform distributionmachine learningunbalanced function

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (2)

An efficient top-down search algorithm for learning Boolean networks of gene expression ⋮ Algorithms for Inference, Analysis and Control of Boolean Networks

Cites Work

• Unnamed Item
• Selection of relevant features and examples in machine learning
• On the complexity of inferring functional dependencies
• Finding essential attributes from binary data
• A simple greedy algorithm for finding functional relations: Efficient implementation and average case analysis
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Learning juntas
• Algorithmic Learning Theory

This page was built for publication: Performance analysis of a greedy algorithm for inferring Boolean functions