Self Organizing Classifiers First Steps In Structured Evolutionary Machine Learning

# Self Organizing Classifiers: First Steps in Structured Evolutionary Machine Learning

**arXiv ID:** 1811.08225
**Authors:** Danilo Vasconcellos Vargas, Hirotaka Takano, Junichi Murata
**Published:** 2018-11-20T13:00:51Z
**Abstract:**
Learning classifier systems (LCSs) are evolutionary machine learning algorithms, flexible enough to be applied to reinforcement, supervised and unsupervised learning problems with good performance. Recently, self organizing classifiers were proposed which are similar to LCSs but have the advantage that in its structured population no balance between niching and fitness pressure is necessary. However, more tests and analysis are required to verify its benefits. Here, a variation of the first algorithm is proposed which uses a parameterless self organizing map (SOM). This algorithm is applied in challenging problems such as big, noisy as well as dynamically changing continuous input-action mazes (growing and compressing mazes are included) with good performance. Moreover, a genetic operator is proposed which utilizes the topological information of the SOM's population structure, improving the results. Thus, the first steps in structured evolutionary machine learning are shown, nonetheless, the problems faced are more difficult than the state-of-art continuous input-action multi-step ones.

## Skill Description

This skill is generated from the arXiv paper: Self Organizing Classifiers: First Steps in Structured Evolutionary Machine Learning (1811.08225).

## How to Use

[To be filled in by the user or by future automation]

## References

- [arXiv:1811.08225](http://arxiv.org/abs/1811.08225v1)