Search

The traditional negative selection algorithm with a randomly generated hypersphere detector is unable to satisfy the development needs of continuous learning due to the inherent defects of the detector. This paper proposes a novel negative selection algorithm for hyper-rectangle detectors that overcomes the shortcomings of randomly generated hyper-sphere detectors and lays the foundation for a negative selection algorithm with continuous learning capability. It uses self-sample clusters of equal-sized hypercubes instead of self-samples for training. The hyper-rectangle detectors are generated by cutting the nonself-space along the boundary of the self-sample clusters. The state space is covered without overlapping each other by self-sample clusters and detectors. The anomaly detection performance of the proposed method was demonstrated using Iris data, vowel recognition data (Vowel), and Wisconsin Breast Cancer (BCW) data. The experimental results show that the proposed method outperforms other artificial immune algorithms and clustering algorithms under the same parameter conditions. [ABSTRACT FROM AUTHOR]

The traditional batch learning classification methods need to obtain all kinds of data once before training. This makes them unable to recognize the data from the unseen types and cannot continuously enhance their classification ability through learning the testing data in the testing process, because they lack continual learning ability. Inspired by the continual learning mechanism of the biological immune system (BIS), this paper proposed a continual learning classification method with single-label memory cells (S-CLCM). The type of testing data is identified by memory cells, and the data type from unseen types is determined by an affinity threshold. New memory cells are cultivated continuously by learning the testing data to enhance the classification ability of S-CLCM gradually. Every memory cell has the same size and a unique type. It becomes a standard batch learning classification method or a standard clustering method under certain conditions. Take the experiments on twenty benchmark datasets to estimate its classification performance and possible superiority. Results show S-CLCM has good performance when it becomes a standard batch learning classification method, and S-CLCM is superior to the other classical classification algorithms when the data from unseen types or new labeled data appear during the testing process. It can improve the classification accuracy by up to 33%, and by at least 14%. [ABSTRACT FROM AUTHOR]