Skip to main content

2019 | Buch

Decision Tree and Ensemble Learning Based on Ant Colony Optimization

insite
SUCHEN

Über dieses Buch

This book not only discusses the important topics in the area of machine learning and combinatorial optimization, it also combines them into one. This was decisive for choosing the material to be included in the book and determining its order of presentation.

Decision trees are a popular method of classification as well as of knowledge representation. At the same time, they are easy to implement as the building blocks of an ensemble of classifiers. Admittedly, however, the task of constructing a near-optimal decision tree is a very complex process.

The good results typically achieved by the ant colony optimization algorithms when dealing with combinatorial optimization problems suggest the possibility of also using that approach for effectively constructing decision trees. The underlying rationale is that both problem classes can be presented as graphs. This fact leads to option of considering a larger spectrum of solutions than those based on the heuristic. Moreover, ant colony optimization algorithms can be used to advantage when building ensembles of classifiers.

This book is a combination of a research monograph and a textbook. It can be used in graduate courses, but is also of interest to researchers, both specialists in machine learning and those applying machine learning methods to cope with problems from any field of R&D.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Theoretical Framework
Abstract
In this chapter we will give a general overview of the main concepts of machine learning and swarm intelligence. Those fields are very broad, and the literature on them is enormous. Here we shall confine ourselves to the definitions pertaining to classification and decision trees, as well as ant colony optimization along with its brief history. Only some concepts will be discussed in detail.
Jan Kozak

Adaptation of Ant Colony Optimization to Decision Trees

Frontmatter
Chapter 2. Evolutionary Computing Techniques in Data Mining
Abstract
In this chapter we present some concepts pertaining to a hybrid approach to classification and clustering. Hybridization amounts to combining standard algorithms, such as those generating decision rules and decision trees, with nonstandard ones, e.g., those based on ant colony optimization (ACO) concepts.
Jan Kozak
Chapter 3. Ant Colony Decision Tree Approach
Abstract
In this chapter we give a detailed description of the most popular ant colony optimization algorithm for learning decision trees. We also present an example which illustrates the main idea of the approach, as well as a detailed discussion on how to apply the pheromone trail in machine learning tasks. Pheromone maps allow for a detailed analysis of how the ant colony decision tree (ACDT) approach works. In the chapter a detailed experimental analysis is also performed, which enables a comparison of the ACDT algorithm with other (classical as well as stochastic) methods.
Jan Kozak
Chapter 4. Adaptive Goal Function of the ACDT Algorithm
Abstract
In this chapter we demonstrate a different way of evaluating ant agent performance. Our goal is to show that decision tree construction need not be only controlled by the classical, popular accuracy measure, but also by recall, precision, F-measure or Matthews correlation coefficient. It is the nondeterministic (probabilistic) element of ant colony optimization algorithms that makes the aforementioned goal achievable.
Jan Kozak
Chapter 5. Examples of Practical Application
Abstract
This chapter presents example applications of the ACDT algorithm. In particular, we discuss application of ACDT to hydrogen bond analysis, e-mail categorization and the Forex market.
Jan Kozak

Adaptation of Ant Colony Optimization to Ensemble Methods

Frontmatter
Chapter 6. Ensemble Methods
Abstract
Another application which delivers good results in ACO based learning is construction of an ensemble of classifiers, or, more precisely—a decision forest. As a natural consequence, a deeper knowledge of classical ensembles of classifiers and their way of operation should be first derived. In this chapter we define decision forests and shortly characterize example ensembles of classifiers—in particular, the methods referred to further on in this book.
Jan Kozak
Chapter 7. Ant Colony Decision Forest Approach
Abstract
Nowadays, a vast majority of nature-inspired methods are focused on finding a single solution as close to the global optimum as possible. However, presenting a single solution instead of a set of solutions with a wide scope of features is not necessarily the best option—a set of solutions may be more desirable instead. Hence an obvious conclusion is that one of the most important criteria is diversity, next to the computation time and the solution accuracy. In this chapter we present ACO based ensemble learning combined with the random forest idea.
Jan Kozak
Chapter 8. Adaptive Ant Colony Decision Forest Approach
Abstract
In this chapter we analyze adaptive and self-adaptive methods for improving performance of ant colony decision trees and forests. Our goal is to present and compare ensemble approaches based on Ant Colony Optimization. The ACDF ensemble (consisting of homogeneous classifiers) described in this chapter is self-adaptive to the analyzed data sets and is characterized by good classification accuracy.
Jan Kozak
Chapter 9. Summary
Abstract
This chapter includes some final remarks and suggestions concerning future work.
Jan Kozak
Metadaten
Titel
Decision Tree and Ensemble Learning Based on Ant Colony Optimization
verfasst von
Jan Kozak
Copyright-Jahr
2019
Electronic ISBN
978-3-319-93752-6
Print ISBN
978-3-319-93751-9
DOI
https://doi.org/10.1007/978-3-319-93752-6