Using bees to solve a data-mining problem expressed as a Max-Sat one

Lecture Notes in Computer Science

Volumn 3562, Issue PART II, 2005, Pages 212-220

  Benatchba, Karima ^a   Admane, Lotfi ^a   Koudil, Mouloud ^a  

^a Institut National de Formation en Informatique   (Algeria)

Author keywords

Data Mining; Maximum Satisfiability; MBO algorithm; Opti mization; Optimisation using bees; Satisfiability

Indexed keywords

EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING;

DATA-MINING PROBLEMS; META-HEURISTICS; POLYNOMIAL ALGORITHMS;

DATA MINING;

EID: 26444440470     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499305_22     Document Type: Conference Paper

References (15)

1. Cook S.A., "The complexity of theorem-proving procedures". Proc. 3rd ACP symp. On theory of computing Association of Computing Machinery, New York, p151-1158, 1971.
2. Garey R.M. and Johnson, "Computers and Intractability, A guide to the Theory of NP-Completeness". W.H. Freeman and CO., San Francisco, 1979.
3. Andr P., "Aspects probabilistes du problme de la satisfaction d'une formule boolenne. Etude des problmes SAT, #SAT et Max-SAT", Thse de doctorat de l'Universit Paris VI, 1993.
4. Dhar V. and Tuzhilin A, "Abstract-Driven Pattern Discovery in Databases " IEEE Trans. on Knowledge and Data Eng., 1993.
5. Fayyad U.M., Piatesky-Shapiro G., Smyth P. and Uthurusamy R., "Advances in Knowledge Discovery and Data-mining" AAAI Press/ the MIT Press, 1996.
6. Berry M.J., Linoff G.S., "Mastering Data Mining", Wiley Computer Publishing Ed., 2000.
7. Admane L., Benatchba K., Koudil M. and Drias H., "Evolutionary methods for solving data-mining problems", IEEE International Conference on Systems, Man & Cybernetics, Netherlands, October 2004.
8. Benatchba K., Admane L., Koudil M. and Drias H. "Application of ant colonies to data-mining expressed as Max-Sat problems", International Conference on Mathematical Methods for Learning, MML'2004, Italy, June 2004.
9. Abbas H.A., "MBO : Marriage in Honey Bees Optimization, A Haplometrosis Polygynous Swarming Approach", The Congress on Evolutionary Computation, CEC2001, Seoul, Korea, May 2001.
10. Abbas H.A., "A single queen single worker honey bees approach to 3-sat", The Genetic and Evolutionary Computation Conference, GECCO2001, San Francisco, USA July 2001.
11. Abbas H.A., J. Teo, "A True Annealing Approach to the Marriage in Honey-Bees Optimization Algorithm", The Inaugural Workshop on Artificial Life (AL'01), pp.1-14, ISBN 0-7317-0508-4, Adelaide, Australia, December 2001.
12. Selman B., Levesque H., Mitchell D., "A New Method for Solving Hard Satisfiability Problems", Proceedings of the Tenth National Conference on Artificial Intelligence, pp.440-446, San Jose, CA, July 1992.
13. Selman B., Kautz H.A., Cohen B., "Noise Strategies for Improving Local Search", Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), pp.337-343, Seattle Washington, 1994.
14. Stutzle T., Hoos H., "A review of the literature on local search algorithms for MAX-SAT", Technical Report AIDA-01-02, Darmstadt University of Technology, Computer Science Department, Intellectics Group, 2001.
15. Gent I.P. and Walsh T., "Towards an Understanding of Hill-climbing Procedures for SAT", Proceeding of National Conference on Artificial Intelligence (AAAI), pp.28-33, 1993.