Using bees to solve a data-mining problem expressed as a max-sat one

Authors:
Karima Benatchba;Lotfi Admane;Mouloud Koudil
Affiliations:
Institut National de formation en Informatique, Oued Smar, Algeria;Institut National de formation en Informatique, Oued Smar, Algeria;Institut National de formation en Informatique, Oued Smar, Algeria
Venue:
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Year:
2005

Citing 7
Cited 10

Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Advances in knowledge discovery and data mining

Advances in knowledge discovery and data mining
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Abstract-Driven Pattern Discovery in Databases

IEEE Transactions on Knowledge and Data Engineering
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A new method for solving hard satisfiability problems

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Towards an understanding of hill-climbing procedures for SAT

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence

On the performance of artificial bee colony (ABC) algorithm

Applied Soft Computing
A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm

Journal of Global Optimization
A survey: algorithms simulating bee swarm intelligence

Artificial Intelligence Review
An object-oriented software implementation of a modified artificial bee colony (ABC) algorithm

NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
A hybrid 'bee(s) algorithm' for solving container loading problems

Applied Soft Computing
New inspirations in swarm intelligence: a survey

International Journal of Bio-Inspired Computation
How can bees colour graphs

International Journal of Bio-Inspired Computation
Modified Adaptive Cuckoo Search (MACS) algorithm and formal description for global optimisation

International Journal of Computer Applications in Technology
Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms

Applied Soft Computing
A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.