Abstract: Generalization is one of the most challenging issues
of Learning Classifier Systems. This feature depends on the
representation method which the system used. Considering the
proposed representation schemes for Learning Classifier System, it
can be concluded that many of them are designed to describe the
shape of the region which the environmental states belong and the
other relations of the environmental state with that region was
ignored. In this paper, we propose a new representation scheme
which is designed to show various relationships between the
environmental state and the region that is specified with a particular
classifier.
Abstract: Since dealing with high dimensional data is
computationally complex and sometimes even intractable, recently
several feature reductions methods have been developed to reduce
the dimensionality of the data in order to simplify the calculation
analysis in various applications such as text categorization, signal
processing, image retrieval, gene expressions and etc. Among feature
reduction techniques, feature selection is one the most popular
methods due to the preservation of the original features.
In this paper, we propose a new unsupervised feature selection
method which will remove redundant features from the original
feature space by the use of probability density functions of various
features. To show the effectiveness of the proposed method, popular
feature selection methods have been implemented and compared.
Experimental results on the several datasets derived from UCI
repository database, illustrate the effectiveness of our proposed
methods in comparison with the other compared methods in terms of
both classification accuracy and the number of selected features.
Abstract: Adaptive Genetic Algorithms extend the Standard Gas
to use dynamic procedures to apply evolutionary operators such as
crossover, mutation and selection. In this paper, we try to propose a
new adaptive genetic algorithm, which is based on the statistical
information of the population as a guideline to tune its crossover,
selection and mutation operators. This algorithms is called Statistical
Genetic Algorithm and is compared with traditional GA in some
benchmark problems.