A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

DOI10.1016/S0895-7177(97)00255-0zbMath1185.90209MaRDI QIDQ969776

A. S. Deshpande, Evangelos Triantaphyllou

Publication date: 8 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Identifying the interacting positions of a protein using Boolean learning and support vector machines, An approach to guided learning of Boolean functions, An incremental learning algorithm for constructing Boolean functions from positive and negative examples, A heuristic for mining association rules in polynomial time.

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuous approach to inductive inference
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• Greedy randomized adaptive search procedures
• An approach to guided learning of Boolean functions
• Asking questions to minimize errors
• Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
• Mathematical Programming in Neural Networks
• A Relationship Between CNF and DNF Systems Derivable from Examples