Abstract
Negative Selection Algorithm (NSA) is one of several algorithms inspired by the principles of natural immune system. The algorithm received the researchers attention due to its applicability in various research areas and a number of valuable efforts are made to increase the effectiveness and efficiency of it. The heart of NSA is to somehow find rules called detectors to discriminate self and anomaly areas. Each detector in NSA defines a subspace of problem space where no self data is located. One of the major issues in NSA is detector’s shape or representation of detectors which can affect the detection performance significantly. This paper for the first time proposes a new representation for detectors based on convex hull. Since convex hull is a general form of other geometric shapes, it retains the benefits of other shapes meanwhile it provides some new features like the asymmetric shape. Experimental results show a significant enhancement in the accuracy of negative selection algorithm compared to other common representation shapes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Forrest, S., Perelson, A.S., Allen, L., Cherukuri, R.: Self-Nonself Discrimination in a Computer. In: The 1994 IEEE Symposium on Security and Privacy, pp. 202–212. IEEE Computer Society, Washington (1994)
D’haeseleer, P., Forrest, S., Helman, P.: Immunological Approach to Change Detection: Algorithms, Analysis and Implications. In: Proceedings of the 1996 IEEE Symposium on Security and Privacy, SP 1996. IEEE Computer Society, Washington (1996)
Ji, Z., Dasgupta, D.: Revisiting Negative Selection Algorithms. Evolutionary Computation 15(2), 223–251 (2007)
Dasgupta, D., Gonzalez, F.: An Immunity-based Technique to Characterize Intrusion In Computer Networks. IEEE Transactions on Evolutionary Computation 6(3), 1081–1088 (2002)
Gonzalez, F., Dasgupta, D.: Anomaly Detection Using Real-valued Negative Selection. Proceedings of Genetic Programming and Evolvable Machines 4, 383–403 (2003)
Shapiro, J.M., Lamont, G.B., Peterson, G.L.: An Evolutionary Algorithm to Generate Hyper-Ellipse Detectors for Negative Selection. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO), Washington, D.C, June 25-29 (2005)
Balachandran, S., Dasgupta, D., Nino, F., Garrett, D.: A framework for evolving multishaped detectors in negative selection. In: Proceedings of IEEE Symposium Series on Computational Intelligence, Honolulu, pp. 401–408. IEEE Press, Los Alamitos (2007)
Ji, Z., Dasgupta, 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)
Ji, Z., Dasgupta, D.: V-detector: An efficient negative selection algorithm with “probably adequate” detector coverage. Information Science 179(10), 1390–1406 (2009)
Jerne, N.K.: Towards a Network Theory of The Immune System. Annales d’immunologie 125c(1), 373–389 (1974)
Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters 1, 132–133 (1972)
Lanzi, P.L., Wilson, S.W.: Using Convex Hulls to Represent Classifier Conditions. In: Proceedings of GECCO (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Majd, M., Shoeleh, F., Hamzeh, A., Hashemi, S. (2010). Towards Efficient and Effective Negative Selection Algorithm: A Convex Hull Representation Scheme. In: Deb, K., et al. Simulated Evolution and Learning. SEAL 2010. Lecture Notes in Computer Science, vol 6457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17298-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-17298-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17297-7
Online ISBN: 978-3-642-17298-4
eBook Packages: Computer ScienceComputer Science (R0)