Robust on-line neural learning classifier system for data streams

-
The ever-increasing integration of technology in the different areas of science and industry has fostered practitioners the design of applications that generate stupendous amounts of data on-line (e.g., smart sensors or network monitoring just to mention two real cases). Extracting information from these data is key, in order to gain a better understanding of the processes that the data are describing. However, learning from these data poses new challenges to traditional data mining techniques, which are not designed to deal with data streams: data in which concepts and noise vary over time.

In this regard, I am proud to present the supervised neural constructivist system (SNCS), a neural Michigan-style Learning Classifier System that has been designed to provide a fast reaction capacity and adaptability to the distinct possible changes in concept (concept drifts) with varying noisy inputs. 

Inheriting the intrinsically on-line fashion of Michigan-style learning classifier systems, SNCS evolves a population of multilayer perceptrons that allow the proposed algorithm to function in a variety of problem situations producing accurate classification of data, whether the data are static or in dynamic streams.

The paper is the following:

Sancho-Asensio, A.; Orriols-Puig, A.; Golobardes, E.; "Robust On-Line Neural Learning Classifier System for Data Stream Classification Tasks," Soft Computing , In Press, 2014.

It can be downloaded from Springer.

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