Study on extension negative selection algorithm
by Tianzhu Wen; Aiqiang Xu; Jiayu Tang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 9, No. 1/2, 2016

Abstract: Aimed at the problems of low generation efficiency, serious redundancy and poor matching capability of detectors, the extension negative selection algorithm (ENSA) is proposed by fusing extenics and artificial intelligence system. The basic conceptions of ENSA are described by basic element, and the affinity between detector and antigen or antibody is calculated by dependent function. The algorithms of extension detector generation and optimisation are designed, and the parameters of them are analysed. Furthermore, the performance of ENSA is analysed both in theory and simulation experiment. The results from the Iris dataset show that when generating five detectors, the coverage rate of ENSA is 87.5% which is 70.28% higher than that of RNSA and 76.95% higher than that of V-Detector algorithm; when the expected coverage rate is 90%, three detectors are required in ENSA, which is 14 fewer than that of RNSA and 74 fewer than that of V-Detector algorithm; when the same antibodies are tested, the correct rate of ESNA and RNSA is 100% while the VDetector algorithm's is 90%.

Online publication date: Thu, 11-Feb-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com