Efficient Algorithms for String-Based Negative Selection
String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of S. Then, use these detectors to partition a monitor set M into self and non-self elements. Implementations of this scheme are often impractical because they need exponential time in the size of S to construct D. Here, we consider r-chunk and r-contiguous detectors, two common implementations that suffer from this problem, and show that compressed representations of D are constructible in polynomial time for any given S and r. Since these representations can themselves be used to classify the elements in M, the worst-case running time of r-chunk and r-contiguous detector based negative selection is reduced from exponential to polynomial.
Unable to display preview. Download preview PDF.
- 1.Forrest, S., Perelson, A.S., Allen, L., Cherukuri, R.: Self-nonself discrimination in a computer. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, pp. 202–212 (1994)Google Scholar
- 3.Stibor, T.: Foundations of r-contiguous matching in negative selection for anomaly detection. Natural Computing (2008)Google Scholar
- 4.Stibor, T.: On the Appropriateness of Negative Selection for Anomaly Detection and Network Intrusion Detection. Ph.D thesis, Darmstadt University of Technology (2006)Google Scholar
- 5.D’Haeseleer, P.: An immunological approach to change detection: theoretical results. In: Proceedings of the 9th IEEE Computer Security Foundations Workshop, pp. 18–26 (1996)Google Scholar
- 7.Esponda, C.: Negative Representations of Information. Ph.D thesis, University of New Mexico (2005)Google Scholar