Article ID Journal Published Year Pages File Type
10331369 Information Processing Letters 2005 6 Pages PDF
Abstract
We analyzed average case performance of a known greedy algorithm for inference of a Boolean function from positive and negative examples, and gave a proof to an experimental conjecture that the greedy algorithm works optimally with high probability if both input data and the underlying function are generated uniformly at random.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Performance analysis of a greedy algorithm for inferring Boolean functions
Authors
, ,