Abstract. The Levenstein or edit distance was developed as a metric for calculating distances between character strings. We are looking at weighting the different edit operations (...
A statistical generative model is presented as an alternative to negative selection in anomaly detection of string data. We extend the probabilistic approach to binary classificat...
In this paper we present our original methodology, in which Matching Pursuit is used for networks anomaly and intrusion detection. The architecture of anomaly-based IDS based on si...
Lukasz Saganowski, Michal Choras, Rafal Renk, Wito...
The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real n...
Weiliang Chen, Reinoud Maex, Rod Adams, Volker Ste...
Abstract This research deals with the use of self-organising maps for the classification of text documents. The aim was to classify documents to separate classes according to their...