A relational data mining tool based on genetic programming

  • Lionel Martin
  • Frédéric Moal
  • Christel Vrain
Communications Session 5. KDD Process and Software
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1510)


In this paper, we present a Data Mining tool based on Genetic Programming which enables to analyze complex databases, involving several relation schemes. In our approach, trees represent expressions of relational algebra and they are evaluated according to the way they discriminate positive and negative examples of the target concept. Nevertheless, relational algebra expressions are strongly typed and classical genetic operators, such as mutation and crossover, have been modified to prevent from building illegal expressions. The Genetic Programming approach that we have developed has been modeled in the framework of constraints.


  1. [AVK95] S. Augier, G. Venturini, and Y. Kodratoff. Learning first order logic rules with a genetic algorithm. In Proceedings of the First International Conference on Knowledge Discovery & Data Mining (KDD’95), pages 21–26, Canada, August 1995.Google Scholar
  2. [BR97] Hendrik Blockeel and Luc De Raedt. Relational knowledge discovery in databases. In Stephen Muggleton, editor, Proceedings of the 6th International Workshop on Inductive Logic Programming (ILP-96), volume 1314 of LNAI, pages 199–211, Berlin, August 26–28 1997. Springer.Google Scholar
  3. [FPSSU96] U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. MIT Press, Mento Park, 1996.Google Scholar
  4. [GSB97] A. Giordana, L. Saitta, and G. Lo Bello. A coevolutionary approach to concept learning. In Zbigniew W. Raś and Andrzej Skowron, editors, Proceedings of the 10th International Symposium on Foundations of Intelligent Systems (ISMIS-97), volume 1325 of LNAI, pages 257–266, Berlin, October 15–18 1997. Springer.Google Scholar
  5. [Koz92] J. R. Koza. Genetic Programming On the programming of computers by means of natural selection. MIT Press, Cambridge, Massachusetts, 1992.MATHGoogle Scholar
  6. [Koz94] J. R. Koza. Genetic Programming II Automatic Discovery of Reusable Programs. MIT Press, Cambridge, Massachusetts, 1994.MATHGoogle Scholar
  7. [MMPS94] D. Michie, S. Muggleton, D. Page, and A. Srinivasan. To the international computing community: A new East-West challenge. Technical report, Oxford University Computing laboratory, Oxford, UK, 1994.Google Scholar
  8. [Mon95] David J. Montana. Strongly typed genetic programming. Evolutionary computation, 3(2):199–230, 1995.Google Scholar
  9. [RE96] Tae-Wan Ryu and Christoph F. Eick. Deriving queries from examples using genetic programming. In Evangelos Simoudis, Jia Wei Han, and Usama Fayyad, editors, The Second International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 303–306, Portland, Oregon, USA, August 2–4 1996. AAAI.Google Scholar
  10. [Sch87] J. C. Schlimmer. Concept acquisition through representational adjustment. Technical Report ICS-TR-87-19, University of California, Irvine, Department of Information and Computer Science, July 1987.Google Scholar
  11. [SJB+93] W. M. Spears, K. A. De Jong, T. Bäck, D. B. Fogel, and H. de Garis. An overview of evolutionary computation. In Pavel B. Brazdil, editor, Proceedings of the European Conference on Machine Learning (ECML-93), volume 667 of LNAI, pages 442–459, Vienna, Austria, April 1993. Springer Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Lionel Martin
    • 1
  • Frédéric Moal
    • 1
  • Christel Vrain
    • 1
  1. 1.LIFOUniversité d’OrléansOrleans cedex 02France

Personalised recommendations