Skip to main content


I am glad to present the Learning Classifier System Open Repository (LCSOR); a repository on LCSs implemented in C++ to further extend these family of machine learning techniques. The files are stored in SourceForge.

The project is divided in three distinct parts: (1) the source code (a tarball for each algorithm), (2) the problem environment, and (3) the documentation in the form of doxygen html.

To start I uploaded the first version of the sUpervised Classifier System (UCS). The current version of this algorithm is 0.98.27, which implements the real interval-based representation (more precisely the unordered-bound representation) and the categorial representation of UCS. Also, the imbalanced estimators are included (see (Orriols-Puig, 2008)). I have codified some other measures of quality: Cohen's Kappa score, precision, recall and the F-Measure (F1).

As you see, this project is just in its infancy and will grow little by little. 

Algorithms included so far:

 - UCS 0.98.27 (SourceProblem environmentDocumentation)

 This new version (9/27/2014) incorporates:
 - Minor bug fixes.

Installation details
In order to compile and install this software follow these steps:

  1. download the source code (e.g., UCS.tar.gz),
  2. uncompress the file using tar ($ tar xvzf UCS.tar.gz),
  3. enter to the directory containing the source code and compile it ($ make),
  4. download the problem environment (e.g.,,
  5. uncompress the file using tar ($ tar xvjf, and
  6. execute the program (e.g, $ ./UCS ../Problems/tao/config/tao.cfg).

Citation details

If you use LCSOR for your research, please cite it with the following:

    author = "Sancho-Asensio, Andreu",
    year = "2014",
    title = "Learning classifier system open repository",
    url = "",
    institution = "Ramon Llull University" 

If you have any comments or find any bug, please send a message!


Orriols-Puig, Albert: "New challenges in learning classifier systems: mining rarities and evolving fuzzy models," PhD Thesis, La Salle, Universitat Ramon Llull,  2008.


Post a Comment

Popular posts from this blog

Toward ensemble methods: A primer with Random Forest

The Kaggle-Higgs competition has attracted my attention very much lately. In this particular challenge, the goal is to generate a predictive model out of a bunch of data taken from distinct LHC’s detectors. The numbers are the following: 250000 properly labeled instances, 30 real-valued features (containing missing values), and two classes, namely background {b} and signal {s}. Also, the site provides a test set consisting of 550000 unlabeled instances. There are nearly 1300 participants while I am writing this post, and a lot of distinct methods are put to the test to win the challenge. Very interestingly, ensemble methods are all in the head of the leaderboard, and the surprise is XGBoost, a gradient boosting method that makes use of binary trees.
After checking the computational horsepower of the XGBoost algorithm by myself, I decided to take a closer look at ensemble methods. To start with, I implemented a Random Forest, an algorithm that consists of many independent binary trees…

High Performance Computing, yet another brief installation tutorial

Today’s mid- and high-end computers come with a tremendous hardware, mostly used in video games and other media software, that can be exploited for advanced computation, that is: High Performance Computing (HPC). This is a hot topic in Deep Learning as modern graphic cards come with huge streaming process power and large and quick memory. The most successful example is in Nvidia’s CUDA platform. In summary, CUDA significantly speeds up the fitting of large neural nets (for instance: from several hours to just a few minutes!).
However, the drawbacks come when setting up the scenario: it is non-trivial to install the requirements and set it running, and personally I had a little trouble the first time as many packages need to be manually compiled and installed in a specific order. The purpose of this entry is to reflect what I did for setting up Theano and Keras with HPC using an Nvidia’s graphic card (in my case a GT730) using GNU/Linux. To do so, I will start assuming a clean Debian …

A conceptual machine for cloning a human driver

If anything else, a Machine Learning practitioner has to get a global view and think on how far our conceptual machines can go. This is a little tale of my recent experience with Deep Learning. To start with, say that I am enrolled in the Udacity’s nanodegree inSelf Driving Car Engineer. Here we are learning the techniques needed for building a car controller capable of driving at the human level. The interesting part of the course (to be read as where one truly learns) is in the so called projects: these are nothing but assignments in which the student has to solve a challenging task, mainly by using Convolutional Neural Networks (convnets), the most well-known Deep Learning models. So far, the most mind-blowing task and the focus of this entry is project 3, were we have to record our driving behavior in a car simulator and let a convnet to clone it and successfully generalize the act of driving. It is remarkable that a convnet learns to control the car from raw color images jointly…