By Topic

T-detectors Maturation Algorithm with in-Match Range Model

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
$33 $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

1 Author(s)
Jungan Chen ; Zhejiang Wanli University, Ningbo, Zhejiang 315100 China. telephone: 081-574-88225878, e-mail:

Negative selection algorithm is used to generate detector for change detection, anomaly detection. But it can not be adapted to the change of self data because the match threshold must be set at first. To solve the problem, I-TMA-GA and TMA-MRM inspired from the maturation of T-cells are proposed. But genetic algorithm is used to evolve the detector population with minimal selfmax. In this paper, to achieve the maximal coverage of nonselves, genetic algorithm is used to evolve the detector population with minimal match range with selfmax and selfmin. An augmented algorithm called T-detectors maturation algorithm based on min-match range model is proposed. The proposed algorithm is tested by simulation experiment for anomaly detection and compared with NSA, I-TMA-GA and TMA-MRM. The results show that the proposed algorithm is more effective than others

Published in:

2006 3rd International IEEE Conference Intelligent Systems

Date of Conference:

Sept. 2006