Elements of information theory
Elements of information theory
On the Length of Programs for Computing Finite Binary Sequences
Journal of the ACM (JACM)
Self-Nonself Discrimination in a Computer
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
An Immunological Approach to Change Detection: Algorithms, Analysis and Implications
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
A Sense of Self for Unix Processes
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Hybrid detector set: detectors with different affinity
InfoSecu '04 Proceedings of the 3rd international conference on Information security
Is negative selection appropriate for anomaly detection?
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Architecture for an Artificial Immune System
Evolutionary Computation
How Do We Evaluate Artificial Immune Systems?
Evolutionary Computation
Probabilistic anomaly detection in distributed computer networks
Science of Computer Programming
Revisiting Negative Selection Algorithms
Evolutionary Computation
On average time complexity of evolutionary negative selection algorithms for anomaly detection
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Efficient Algorithms for String-Based Negative Selection
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
Finding abnormal events in home sensor network environment using correlation graph
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A self-adaptive evolutionary negative selection approach for home anomaly events detection
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
A generative model for self/non-self discrimination in strings
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Negative selection algorithms on strings with efficient training and linear-time classification
Theoretical Computer Science
An immunological approach to change detection: algorithms, analysis and implications
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Algorithms of non-self detector by negative selection principle in artificial immune system
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Multiple-Point bit mutation method of detector generation for SNSD model
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part III
A bio-inspired approach for self-protecting an organic middleware with artificial antibodies
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
A comparative study of real-valued negative selection to statistical anomaly detection techniques
ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
Application of the feature-detection rule to the Negative Selection Algorithm
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
This paper examines some of the theoretical foundations of the distributable change detection method introduced by Forrest et al., including fundamental bounds on some of its parameters. A short overview is given of the reasoning behind this method, its immunological counterpart and its computer implementation. The amount of information that is lost by splitting a data stream into unordered strings can be estimated, and this estimate can be used to guide the choice of string length. A lower bound on the size of the detector set is derived, based on information-theoretic grounds. The principle of holes (undetectable nonself strings) is illustrated, along with a proof of their existence for a large class of matching rules. The influence of holes on the achievable failure rate is discussed, along with guidelines on how to avoid them.