Abstract
Negative Selection Algorithm is widely applied in Artificial Immune Systems, but it is not fast enough when there are mass data need to be processed. Multi-pattern matching algorithms are able to locate all occurrences of multi-patterns in an input string by just one scan operation. Inspired by the multi-pattern matching algorithm proposed by Aho and Corasick in 1975 [1], a novel fast negative selection algorithm is proposed for the “r-contiguous-bits” matching rule in this paper. The algorithm constructs a self state graph and a detector state graph according to the self set and the detector set respectively, and processes input strings using partial matching algorithm based on the state graph. The time complexity of this algorithm when processing an input string of length l is O(l). Experiments are carried out to make comparisons on the time and space costs between this new algorithm and the traditional negative selection algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM 18(6), 333–340 (1975)
Forrest, S., Perelson, A.S., Allen, L., Cherukuri, R.: Self-Nonself Discrimination in a Computer. In: Proceedings of 1994 IEEE Symposium on Research in Security and Privacy, pp. 202–212. IEEE Computer Society Press, Los Alamitos, CA (1994)
Wu, S., Manber, U.: Agrep - a Fast Approximate Pattern Matching Tool. In: Proceedings of USENIX Winter Technical Conference, pp. 153–162 (1992)
Wu, S., Manber, U.: A Fast Algorithm for Multi-Pattern Searching. Technical Report, TR 94-17. University of Arizona, Tucson, AZ (May 1994)
Wang, Y., Shen, Z., Xu, Y.: Improved Algorithms for Matching Multiple Patterns (in Chinese). Journal of Computer Research and Development 39(1), 55–60 (2002)
Tuck, N., Sherwood, T., Calder, B., Varghese, G.: Deterministic Memory Efficient String Matching Algorithms for Intrusion Detection. In: Proceedings of IEEE Infocom 2004, Piscataway, pp. 333–340. IEEE Computer Society Press, Los Alamitos (2004)
Percus, J.K., Percus, O.E., Perelson, A.S.: Predicting the Size of the T-Cell Receptor and Antibody Combining Region from Consideration of Efficient Self-Nonself Discrimination. Proceedings of the National Academy of Sciences 90, 1691–1695 (1993)
Percus, J.K., Percus, O.E., Perelson, A.S.: Probability of Self-Nonself Discrimination. In: Perelson, A.S., Weisbuch, G. (eds.) Theoretical and Experimental Insights into Immunologyedn, pp. 63–70. Springer, New York (1993)
Kurgan, L., Cios, K., Tadeusiewicz, R., Ogiela, M., Goodenday, L.: Knowledge Discovery Approach to Automated Cardiac Spect Diagnosis. Artificial Intelligence in Medicine 23(2), 149–169 (2001)
Helman, P., Forrest, S.: An Efficient Algorithm for Generating Random Antibody Strings, Technical Report CS-94-07. Department of Computer Science, University of New Mexico, Albuquerque, New Mexico (1994)
D’haeseleer, P.: Further Efficient Algorithms for Generating Antibody Strings, Technical Report CS95-3. Department of Computer Science, University of New Mexico, Albuquerque, New Mexico (1995)
D’haeseleer, P., Forrest, S., Helman, P.: An Immunological Approach to Change Detection: Algorithms, Analysis and Implications. In: Proceedings of 1996 IEEE Symposium on Security and Privacy, pp. 110–119. IEEE Computer Society Press, Los Alamitos, CA (1996)
Zhou, J., Dasgupata, D.: Real-Valued Negative Selection Algorithm with Variable-Sized Detectors. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 287–298. Springer, Heidelberg (2004)
Zhou, J., Dasgupata, D.: Augmented Negative Selection Algorithm with Variable-Coverage Detectors. In: CEC 2004. Proceedings of the 2004 Congress on Evolutionary Computation, vol. 1, pp. 1081–1088 (2004)
Zhang, H., Wu, L., Zhang, Y., Zeng, Q.: An Algorithm of R-Adjustable Negative Selection Algorithm and Its Simulation Analysis (in Chinese). Chinese Journal of Computers 28(10), 1614–1619 (2005)
Luo, W., Wang, X., Tan, Y., Wang, X.: A Novel Negative Selection Algorithm with an Array of Partial Matching Lengths for Each Detector. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) Parallel Problem Solving from Nature - PPSN IX. LNCS, vol. 4193, pp. 112–121. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, W., Wang, X., Wang, X. (2007). A Novel Fast Negative Selection Algorithm Enhanced by State Graphs. In: de Castro, L.N., Von Zuben, F.J., Knidel, H. (eds) Artificial Immune Systems. ICARIS 2007. Lecture Notes in Computer Science, vol 4628. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73922-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-73922-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73921-0
Online ISBN: 978-3-540-73922-7
eBook Packages: Computer ScienceComputer Science (R0)