Genetic and Evolutionary Computation Conference

GECCO 2004: Genetic and Evolutionary Computation – GECCO 2004 pp 287-298

Real-Valued Negative Selection Algorithm with Variable-Sized Detectors

  • Zhou Ji
  • Dipankar Dasgupta
Conference paper

DOI: 10.1007/978-3-540-24854-5_30

Volume 3102 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ji Z., Dasgupta D. (2004) Real-Valued Negative Selection Algorithm with Variable-Sized Detectors. In: Deb K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg

Abstract

A new scheme of detector generation and matching mechanism for negative selection algorithm is introduced featuring detectors with variable properties. While detectors can be variable in different ways using this concept, the paper describes an algorithm when the variable parameter is the size of the detectors in real-valued space. The algorithm is tested using synthetic and real-world datasets, including time series data that are transformed into multiple-dimensional data during the preprocessing phase. Preliminary results demonstrate that the new approach enhances the negative selection algorithm in efficiency and reliability without significant increase in complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zhou Ji
    • 1
  • Dipankar Dasgupta
    • 2
  1. 1.St. Jude Children’s Research HospitalMemphisUSA
  2. 2.The University of MemphisMemphisUSA