Minimal approximate hitting sets and rule templates

DOI10.1016/S0888-613X(00)00051-7zbMath0968.68139WikidataQ127753643 ScholiaQ127753643MaRDI QIDQ1594848

Staal Vinterbo, Aleksander Øhrn

Publication date: 13 September 2001

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

zbMATH Keywords

genetic algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

Integration of rough set and neural network ensemble to predict the configuration performance of a modular product family ⋮ A multiple testing method for hypotheses structured in a directed acyclic graph ⋮ The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Mining classification rules with Reduced MEPAR-miner Algorithm ⋮ The computation of hitting sets: Review and new algorithms

Uses Software

• UCI-ml
• Genocop
• ROSETTA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple sub-quadratic algorithm for computing the subset partial order
• Structure preserving reductions among convex optimization problems
• Approximation algorithms for combinatorial problems
• Rough sets
• On the primer selection problem in polymerase chain reaction experiments

This page was built for publication: Minimal approximate hitting sets and rule templates