LCSOR

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 (Source, Problem environment, Documentation)

 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., Problems.tar.bz),
  5. uncompress the file using tar ($ tar xvjf Problems.tar.bz), 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:

@misc{LCSOR2014,
    author = "Sancho-Asensio, Andreu",
    year = "2014",
    title = "Learning classifier system open repository",
    url = "http://andreusancho.blogspot.com.es/p/lcsor.html",
    institution = "Ramon Llull University" 
}


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


References

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

Comments

Post a Comment

Popular posts from this blog

Data Streams and VFML

We live in a technological world crowded of information. Every device we can think of can give us a bunch of such data, usually in the form of a flow or stream of information in, more or less, real time . In this particular situation classical knowledge discovery mechanisms (like our loved C4.5, a decision tree developed by Quinlan) are completely unable of extract a correct model of the situation. But, what is so special with flows of data? Following the words of Gama and Rodriques: a data stream is an ordered sequence of instances that can be read only once or a small number of times using limited computing and storage capabilities. These sources of data are characterized by being open-ended, following at high speed, and generated by non-stationary distributions in dynamic environments . So, to properly handle this kind of knowledge the learning algorithm has to learn on line and process massive amounts of data increasing the challenges to be faced. Let's hold one's breath w...
Read more

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 indep...
Read more

Optimization: Simplex Algorithm

Imagine we have a set of computers running simulations. Those computers can be described by a group of features, for example its power consumption per hour and the total number of processes it can run per hour. From our R+D personnel, a series of programs are send to these computers so we have to perform some schedule to run the applications, but for our profit we wish to minimise the total consumption of the set of machines. Let's show some more detail: Computer 1 has a power consumption of 100 watts per hour and can run 10  high cpu-demanding processes per hour and 7 low cpu-demanding processes per hour at the same time. Computer 2 has a power consumption of 350 watts per hour and can run 60 high cpu-demanding processes per hour and 20 low cpu-demanding processes per hour at the same time. From the R+D area there are a set of at least 3125 high cpu-demanding processes and at least 710 low cpu-demanding processes to be processed. How many hours should o...
Read more