Sciweavers

ICANNGA
2009
Springer
173views Algorithms» more  ICANNGA 2009»
13 years 9 months ago
On Document Classification with Self-Organising Maps
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...
Jyri Saarikoski, Kalervo Järvelin, Jorma Laur...
ICANNGA
2009
Springer
163views Algorithms» more  ICANNGA 2009»
14 years 3 months ago
Elitistic Evolution: An Efficient Heuristic for Global Optimization
A new evolutionary algorithm, Elitistic Evolution (termed EEv), is proposed in this paper. EEv is an evolutionary method for numerical optimization with adaptive behavior. EEv uses...
Francisco Viveros Jiménez, Efrén Mez...
ICANNGA
2009
Springer
141views Algorithms» more  ICANNGA 2009»
14 years 3 months ago
Connection Strategies in Associative Memory Models with Spiking and Non-spiking Neurons
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...
ICANNGA
2009
Springer
212views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
Evolutionary Regression Modeling with Active Learning: An Application to Rainfall Runoff Modeling
Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a feasible alte...
Ivo Couckuyt, Dirk Gorissen, Hamed Rouhani, Eric L...
ICANNGA
2009
Springer
133views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
Visualizing Time Series State Changes with Prototype Based Clustering
Modern process and condition monitoring systems produce a huge amount of data which is hard to analyze manually. Previous analyzing techniques disregard time information and concen...
Markus Pylvänen, Sami Äyrämö, ...
ICANNGA
2009
Springer
130views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
String Distances and Uniformities
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 (...
David W. Pearson, Jean-Christophe Janodet
ICANNGA
2009
Springer
201views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
A Novel Signal-Based Approach to Anomaly Detection in IDS Systems
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...
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
ICANNGA
2009
Springer
134views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
A Generative Model for Self/Non-self Discrimination in Strings
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...
Matti Pöllä
ICANNGA
2009
Springer
203views Algorithms» more  ICANNGA 2009»
14 years 5 months ago
NEAT in HyperNEAT Substituted with Genetic Programming
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
Zdenek Buk, Jan Koutník, Miroslav Snorek