On the complexity of inferring functional dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Boolean matching using generalized Reed-Muller forms
DAC '94 Proceedings of the 31st annual Design Automation Conference
Randomized algorithms
Selection of relevant features and examples in machine learning
Artificial Intelligence - Special issue on relevance
Approximation algorithms
A Minimization Approach to Propositional Inductive Learning
ECML '95 Proceedings of the 8th European Conference on Machine Learning
Approximating Minimum Keys and Optimal Substructure Screens
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Finding Essential Attributes from Binary Data
Annals of Mathematics and Artificial Intelligence
Algorithms for Inference, Analysis and Control of Boolean Networks
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Hi-index | 0.89 |
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.