Performance analysis of a greedy algorithm for inferring Boolean functions
From MaRDI portal
Recommendations
- A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
- Robust inference of relevant attributes
- scientific article; zbMATH DE number 847791
- Bounds on the Performance of a Greedy Algorithm for Probabilities
- The worst case behavior of a greedy algorithm for a class of pseudo- Boolean functions
Cites work
- 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
- Finding essential attributes from binary data
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Learning juntas
- On the complexity of inferring functional dependencies
- Robust inference of relevant attributes
- Selection of relevant features and examples in machine learning
Cited in
(4)
This page was built for publication: Performance analysis of a greedy algorithm for inferring Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834975)