By Topic

Using ant colonies to solve data-mining problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Admane, L. ; Institut Nat. de formation en Informatique, Algeria ; Benatchba, K. ; Koudil, M. ; Drias, H.
more authors

Data mining is a constantly growing area. More and more domains of the daily life take advantage of the available tools (medicine, trade, meteorology, ...). However, such tools are confronted to a particular problem: the great number of characteristics that qualify data samples. They are more or less victims of the abundance of information. Sat domain benefits from the appearance of powerful solvers that can process huge amounts of data in short times. This paper proposes to solve supervised learning problems expressed as Sat ones. This is done to take advantage of an existing environment that allows experimenting different heuristics, such as: tabu search, genetic algorithm, ant colonies, etc., in order to extract solutions that satisfy a maximum number of clauses (Max-Sat problem). Finally, the best solutions are back-translated into rules that are applied to the data sets in order to verify that they really satisfy a maximum number of instances in the original learning problem.

Published in:

Systems, Man and Cybernetics, 2004 IEEE International Conference on  (Volume:4 )

Date of Conference:

10-13 Oct. 2004