The DOI matches its Crossref record.
Revisiting Negative Selection Algorithms
Abstract
This paper reviews the progress of negative selection algorithms, an anomaly/change detection approach in Artificial Immune Systems (AIS). Following its initial model, we try to identify the fundamental characteristics of this family of algorithms and summarize their diversities. There exist various elements in this method, including data representation, coverage estimate, affinity measure, and matching rules, which are discussed for different variations. The various negative selection algorithms are categorized by different criteria as well. The relationship and possible combinations with other AIS or other machine learning methods are discussed. Prospective development and applicability of negative selection algorithms and their influence on related areas are then speculated based on the discussion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 10
- 10.1109/TIE.2003.809418 · DOI
- 10.1109/TEVC.2002.1011541 · doi:10.1109/tevc.2002.1011541
- 10.1162/1063656054088512 · DOI · Paper page
- 10.1023/A:1026195112518 · DOI · Paper page
- Hang X., 2004, LNCS 3102, Proceedings of GECCO, pages, 275
- 10.1109/TEVC.2002.1011540 · DOI · Paper page
- Hofmeyr S. A., 2000, Evolutionary Computation, 7, 45
- Ji Z., 2004, LNCS 3102, Proceedings of GECCO, pages, 287
- Stibor T., 2004, LNCS 3102, Proceedings of the Conference on Genetic and Evolutionary Computation, pages, 299
- Wierzchon S., 2000, Journal of Computer Science and Technology, 1, 1
Cited by
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
The use of computational intelligence in intrusion detection systems: A review
Wu, S. X., & Banzhaf, W. (2010) · Applied Soft Computing · doi:10.1016/j.asoc.2009.06.019 · Cited by 696
Metaheuristic Algorithms: A Comprehensive Review
Abdel-Basset, M., Abdel-Fatah, L., & Sangaiah, A. K. (2018) · Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications · doi:10.1016/b978-0-12-813314-9.00010-4 · Cited by 637
Multiobjective Immune Algorithm with Nondominated Neighbor-Based Selection
Gong, M., Jiao, L., Du, H., & Bo, L. (2008) · Evolutionary Computation · doi:10.1162/evco.2008.16.2.225 · Cited by 486
Recent Advances in Artificial Immune Systems: Models and Applications
Dasgupta, D., Yu, S., & Nino, F. (2011) · Applied Soft Computing · doi:10.1016/j.asoc.2010.08.024 · Cited by 396
Self-citation
Metadata
- Authors
- Ji, Z., & Dasgupta, D.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2007-06
- Volume
- 15
- Issue
- 2
- Pages
- 223-251
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2116008099
- Cited by
- 199
- References
- 0
- FWCI
- 11.66
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Revisiting Negative Selection Algorithms. https://app.cochat.ai/papers/10.1162/evco.2007.15.2.223
- The paper
- Ji, Z., & Dasgupta, D. (2007). Revisiting Negative Selection Algorithms. Evolutionary Computation. https://doi.org/10.1162/evco.2007.15.2.223
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.