Save analysis of your results

Over the last few years, the increasing interest in machine learning has resulted in the design and development of several competitive learners. Usually, the performance of these methods is evaluated by comparing the new techniques to state-of-the-art methods over a collection of real-world problems.
In early days, these comparisons followed no standard, and qualitative arguments […]

Over the last few years, the increasing interest in machine learning has resulted in the design and development of several competitive learners. Usually, the performance of these methods is evaluated by comparing the new techniques to state-of-the-art methods over a collection of real-world problems.

In early days, these comparisons followed no standard, and qualitative arguments where used to extract conclusions from the results. Although these types of analyses enabled highlighting key points about the results, they also depended, to a certain extent, on the eyes of the beholder. Therefore, the need for finding a saver framework to analyze the results arose. With these, several researchers started drawing a methodology based on statistical tests. In the last three years, the first papers appeared on that topic. One of the first contributions can be found in the paper “Statistical Comparisons of Classifiers over Multiple Data Sets” by Janez Demsar. Later on, several authors extended this first efforts to build a save environment for results analysis.

And even more recently, Francisco Herrera and his research group gathered all these efforts and made a tutorial which is available here. The tutorial explains how different tests work and draws different ways to take when applying a statistical analysis to your results.

The mysterious world of the quantum physics

Three weeks ago I read the post Prof. Cirac interviewed about quantum physics and theory information, where you can find the link to the video of the Cirac’s interview by […]

Three weeks ago I read the post Prof. Cirac interviewed about quantum physics and theory information, where you can find the link to the video of the Cirac’s interview by a Catalan TV. It is amazing how Prof. Cirac introduces some basics of the quantum physics by using easy words and a couple of dices. Basically, he explains the existence of two worlds: the macroscopic world (the real-world, as we know it) and the microscopic world (the world of tiny things, such as the particles). The quantum physics lives in the latter; a tailored world governed by its own laws which open the doors to parallel universes that allow paradoxical phenomena. The interest of the interview was the development of quantum computers and a revealing cryptography method to transmit information in an indecipherable way. How to ensure the reliability of such a secured transmission? Because there is no transmission by a channel, information just appears in the right place at the right moment.

This nice introduction helped me to follow the exciting talk Quantum computer compilers, performed by Prof. Al Aho, a computer science celebrity and one of the authors of the AWK programming language and of the so-called Dragon Book, Compilers: Principles, techniques, and tools.

The talk focused on the following six questions:

1. Why is there so much excitement about quantum computing?
2. How is a quantum computer different from a classical computer?
3. What is a good programming model for a quantum computer?
4. What would make a good quantum programming language?
5. What are the issues in making quantum computer compilers?
6. When are we likely to see scalable quantum computers?

Prof. Aho presented, with a clear explanation and a touch of humor, the fascinating field of the quantum computers by describing how “computation is just a particle dancing around others”, enumerating the four postulates of the quantum mechanics, mentioning that quantum teleportation is information transmission based on changes that take place instantly, envisaging programming without copy operation… However, despite the wonders of the quantum computers, it seems that we should wait a little bit more for being able to solve NP-hard problem.

Finally, take a glance at The Blog of Scott Aaronson. This is an unusual and interesting blog about this topic.

The mysterious world of the quantum physics

Three weeks ago I read the post Prof. Cirac interviewed about quantum physics and theory information, where you can find the link to the video of the Cirac’s interview by a Catalan TV. It is amazing how Prof. Cirac introduces some basics of the quantum physics by using easy words and a couple of dices. […]

Three weeks ago I read the post Prof. Cirac interviewed about quantum physics and theory information, where you can find the link to the video of the Cirac’s interview by a Catalan TV. It is amazing how Prof. Cirac introduces some basics of the quantum physics by using easy words and a couple of dices. Basically, he explains the existence of two worlds: the macroscopic world (the real-world, as we know it) and the microscopic world (the world of tiny things, such as the particles). The quantum physics lives in the latter; a tailored world governed by its own laws which open the doors to parallel universes that allow paradoxical phenomena. The interest of the interview was the development of quantum computers and a revealing cryptography method to transmit information in an indecipherable way. How to ensure the reliability of such a secured transmission? Because there is no transmission by a channel, information just appears in the right place at the right moment.

This nice introduction helped me to follow the exciting talk Quantum computer compilers, performed by Prof. Al Aho, a computer science celebrity and one of the authors of the AWK programming language and of the so-called Dragon Book, Compilers: Principles, techniques, and tools.

The talk focused on the following six questions:

1. Why is there so much excitement about quantum computing?
2. How is a quantum computer different from a classical computer?
3. What is a good programming model for a quantum computer?
4. What would make a good quantum programming language?
5. What are the issues in making quantum computer compilers?
6. When are we likely to see scalable quantum computers?

Prof. Aho presented, with a clear explanation and a touch of humor, the fascinating field of the quantum computers by describing how “computation is just a particle dancing around others”, enumerating the four postulates of the quantum mechanics, mentioning that quantum teleportation is information transmission based on changes that take place instantly, envisaging programming without copy operation… However, despite the wonders of the quantum computers, it seems that we should wait a little bit more for being able to solve NP-hard problem.

Finally, take a glance at The Blog of Scott Aaronson. This is an unusual and interesting blog about this topic.

Beyond Homemade Artificial Data Sets in HAIS 2009

Find below the presentation of the paper Beyond Homemade Artificial Data Sets by Núria Macià, Albert Orriols-Puig, and Ester Bernadó-Mansilla in the 2009 Hybrid Artificial Intelligence Systems (HAIS’09).

This work aims at creating boundedly difficult problems for data classification whose complexity moves through different dimensions. For this purpose, this work proposes the use of a multi-objective […]

Find below the presentation of the paper Beyond Homemade Artificial Data Sets by Núria Macià, Albert Orriols-Puig, and Ester Bernadó-Mansilla in the 2009 Hybrid Artificial Intelligence Systems (HAIS’09).

This work aims at creating boundedly difficult problems for data classification whose complexity moves through different dimensions. For this purpose, this work proposes the use of a multi-objective optimization procedure to create data sets that satisfy different criteria of complexity. Please, refer to a preprint of the paper for more information.

HAIS 2009

The special session Knowledge extraction based on evolutionary learning, organized by Salvador García, Albert Orriols, and José Otero, was one of the opening sessions of the 4th international conference on hybrid artificial intelligent systems (HAIS 2009). Its program, full of interesting talks that discussed the new trends for knowledge extraction processes by means of evolutionary […]

The special session Knowledge extraction based on evolutionary learning, organized by Salvador García, Albert Orriols, and José Otero, was one of the opening sessions of the 4th international conference on hybrid artificial intelligent systems (HAIS 2009).

Its program, full of interesting talks that discussed the new trends for knowledge extraction processes by means of evolutionary algorithms, included two contributions from the GRSI entitled: Multiobjective evolutionary clustering approach to security vulnerability assessments and Beyond homemade artificial data sets, presented by Guiomar Corral and Albert Orriols respectively.

Guiomar Corral introduced an evolutionary multiobjective approach to cluster the devices of a network with similar vulnerabilities. This technique provides analysts with a map which is helpful to detect malicious attacks or unauthorized changes in the network.

Albert Orriols, in turn, addressed a hot topic in machine learning: the artificial data sets generation. He explained the importance to work under a controlled experimental framework and pointed some ideas to build it.

Salamanca will be for one more day a forum to exchange new ideas and present recent developments in the field of artificial intelligence.

HAIS 2009

The special session Knowledge extraction based on evolutionary learning, organized by Salvador García, Albert Orriols, and José Otero, was one of the opening sessions of the 4th international conference on […]

The special session Knowledge extraction based on evolutionary learning, organized by Salvador García, Albert Orriols, and José Otero, was one of the opening sessions of the 4th international conference on hybrid artificial intelligent systems (HAIS 2009).

Its program, full of interesting talks that discussed the new trends for knowledge extraction processes by means of evolutionary algorithms, included two contributions from the GRSI entitled: Multiobjective evolutionary clustering approach to security vulnerability assessments and Beyond homemade artificial data sets, presented by Guiomar Corral and Albert Orriols respectively.

Guiomar Corral introduced an evolutionary multiobjective approach to cluster the devices of a network with similar vulnerabilities. This technique provides analysts with a map which is helpful to detect malicious attacks or unauthorized changes in the network.

Albert Orriols, in turn, addressed a hot topic in machine learning: the artificial data sets generation. He explained the importance to work under a controlled experimental framework and pointed some ideas to build it.

Salamanca will be for one more day a forum to exchange new ideas and present recent developments in the field of artificial intelligence.

Getting ready for HAIS 2009

Tomorrow, the international Hybrid Artificial Intelligence Systems conference (HAIS) gets started in Salamanca with the special session of Knowledge Extraction based on Evolutionary Learning (KEEL). In this special session, the following 14 papers that use evolutionary algorithms for different purposes in the field of machine learning will be presented:

A hybrid bumble bees mating optimization […]

Tomorrow, the international Hybrid Artificial Intelligence Systems conference (HAIS) gets started in Salamanca with the special session of Knowledge Extraction based on Evolutionary Learning (KEEL). In this special session, the following 14 papers that use evolutionary algorithms for different purposes in the field of machine learning will be presented:

  1. A hybrid bumble bees mating optimization – GRASP algorithm for clustering by Yannis Marinakis, Magdalene Marinaki, and Nikolaos Matsatsinis
  2. A first study on the use of cooperative coevolution for instance and feature selection in classification with nearest neighbour rule by Joaquín Derrac, Salvador García, and Francisco Herrera
  3. Unsupervised feature selection in high dimensional spaces and uncertainty by José R. Villar, María R. Suárez, Javier Sedano, and Felipe Mateos
  4. Non-dominated multi-objective evolutionary algorithm based on fuzzy rules extraction for subgroup discovery by C. J. Carmona, P. González, M.J. del Jesus, and F. Herrera
  5. A first study on the use of interval-valued fuzzy sets with genetic tuning for classification with imbalanced data-sets by J. Sanz, A. Fernández, H. Bustince, and F. Herrera
  6. Feature construction and feature selection in presence of attribute interactions by Leila S. Shafti and Eduardo Pérez
  7. Multiobjective evolutionary clustering approach to security vulnerability assessments by Guiomar Corral, Àlvaro Garcia-Piquer, Albert Orriols-Puig, Albert Fornells, and Elisabet Golobardes
  8. Beyond homemade artificial data sets by Nuria Macià, Albert Orriols-Puig, and Ester Bernadó-Mansilla
  9. A three-objective evolutionary approach to generate Mamdani fuzzy rule-based systems by Michela Antonelli, Pietro Ducange, Beatrice Lazzerini, and Francesco Marcelloni
  10. A new component selection algorithm based on metrics and fuzzy clustering analysis by Camelia Serban, Andreea Vescan, and Horia F. Pop
  11. Multilabel classification with gene expression programming by J. L. Ávila, E. L. Gibaja, and S. Ventura
  12. An evolutionary ensemble-based method for rule extraction with distributed data by Diego M. Escalante, Miguel Angel Rodriguez, and Antonio Peregrin
  13. Evolutionary extraction of association rules: A preliminary study on their effectiveness by Nicolò Flugy Papè, Jesús Alcalá-Fdez, Andrea Bonarini, and Francisco Herrera
  14. A minimum-risk genetic fuzzy classifier based on low quality data by Ana M. Palacios, Luciano Sánchez, and Inés Couso

We’ll have to wait until tomorrow to know more what these promising titles hide.

Analysis and Improvement of the genetic discovery component of XCS

by Sergio Morales-Ortigosa, Albert Orriols-Puig, and Ester Bernadó-Mansilla. Special issue of Data Mining and Hybrid Intelligent Systems in the International Journal of Hybrid and Intelligent Systems,  [Publisher site] [Preprint – pdf]
XCS is a learning classifier system that uses genetic algorithms to evolve a population of classifiers online. When applied to classification problems described by continuous […]

by Sergio Morales-Ortigosa, Albert Orriols-Puig, and Ester Bernadó-Mansilla. Special issue of Data Mining and Hybrid Intelligent Systems in the International Journal of Hybrid and Intelligent Systems,  [Publisher site] [Preprint – pdf]

XCS is a learning classifier system that uses genetic algorithms to evolve a population of classifiers online. When applied to classification problems described by continuous attributes, XCS has demonstrated to be able to evolve classification models—represented as a set of independent interval-based rules—that are, at least, as accurate as those created by some of the most competitive machine learning techniques such as C4.5. Despite these successful results, analyses of how the different genetic operators affect the rule evolution for the interval-based rule representation are lacking. This paper focuses on this issue and conducts a systematic experimental analysis of the effect of the different genetic operators. The observations and conclusions drawn from the analysis are used as a tool for designing new operators that enable the system to extract models that are more accurate than those obtained by the original XCS scheme. More specifically, the system is provided with a new discovery component based on evolution strategies, and a new crossover operator is designed for both the original discovery component and the new one based on evolution strategies. In all these cases, the behavior of the new operators are carefully analyzed and compared with the ones provided by original XCS. The overall analysis enables us to supply important insights into the behavior of different operators and to improve the learning of interval-based rules in real-world domains on average.

Prof. Cirac interviewed about quantum physics and theory information

A few days ago, Prof. Cirac was interviewed in a Catalan TV channel about his work on quantum theory of information. Prof. Cirac explained the method based on quantum cryptography that he and his team have been developing during the last few years, which makes sure that the information can be neither intercepted nor decrypted. […]

A few days ago, Prof. Cirac was interviewed in a Catalan TV channel about his work on quantum theory of information. Prof. Cirac explained the method based on quantum cryptography that he and his team have been developing during the last few years, which makes sure that the information can be neither intercepted nor decrypted. Actually the information is not physically transmitted, but just appears at the receiver side.

In addition to the method itself, I was surprised by the clarity with which Prof. Cirac introduced quantum physics and reviewed some of its paradoxes. In what follows, you can find a link to the video. Unfortunately, the interview is only in Catalan (interviewer) and Spanish (Prof. Cirac).

Genetic algorithms rediscover laws of physics

Over the last few decades, it has been shown that GAs (and derivate methods such as GPs) are able to solve complex real-world problems and rediscover engineering and scientific findings which were originally deduced after many years of investigation. Recently, Hod Lipson and Michael Schmidt have provided the scientific community with another cool […]

Over the last few decades, it has been shown that GAs (and derivate methods such as GPs) are able to solve complex real-world problems and rediscover engineering and scientific findings which were originally deduced after many years of investigation. Recently, Hod Lipson and Michael Schmidt have provided the scientific community with another cool application of GAs. In this case, Lipson and Smith designed a system that was able to extrapolate the laws of motion from pendulum’s swings.

The program starts with a set of data that describes the pendulum’s swings. Then, the program first creates random combinations of basic mathematical processes such as addition, substraction, multiplication, division, and a few more algebraic operators. Therefore, each individual forms an equation that explains the data. Then, the population of individuals is evolved by the typical genetic operators. This approach resulted in equations that are very similar to the law of conservation of momentum and Newton’s law of motion.

The paper associated to this research has been recently published in Science.