Minimal approximate hitting sets and rule templates
From MaRDI portal
Publication:1594848
DOI10.1016/S0888-613X(00)00051-7zbMath0968.68139MaRDI QIDQ1594848
Staal Vinterbo, Aleksander Øhrn
Publication date: 13 September 2001
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
68T05: Learning and adaptive systems in artificial intelligence
Related Items
The computation of hitting sets: Review and new algorithms, Mining classification rules with Reduced MEPAR-miner Algorithm, Integration of rough set and neural network ensemble to predict the configuration performance of a modular product family
Uses Software
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