Using Bees to Solve a Data-Mining Problem Expressed as a Max-Sat One

摘要

The "NP-Complete" class gathers very significant practical problems such as Sat, Max-Sat, partitioning There is not polynomial algorithm for the resolution of these problems. As a result, the interest in heuristics and meta-heuristics is still growing. In this paper, we present a very recent metaheuristic introduced to solve a 3-sat problem. This metaheuristic can be classified as an evolutionary algorithm. It is based on the process of bees' reproduction. We adapted it for the resolution of the Max-Sat problem. We tested it on a medical benchmark obtained from a data-mining problem that we translated into a Max-Sat problem.