Genetically optimized fuzzy decision trees

Authors:
W. Pedrycz;Z. A. Sosnowski
Affiliations:
Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, Alta., Canada;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2005

Citing 0
Cited 6

A methodology for the automated creation of fuzzy expert systems for ischaemic and arrhythmic beat classification based on a set of rules obtained by a decision tree

Artificial Intelligence in Medicine
A methodology for automated fuzzy model generation

Fuzzy Sets and Systems
Prediction of periventricular leukomalacia. Part I: Selection of hemodynamic features using logistic regression and decision tree algorithms

Artificial Intelligence in Medicine
Recent Literature

Fuzzy Sets and Systems
An adaptive history network method to improve the genetic optimization of pattern recognition systems

FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
A hybrid particle swarm optimization based fuzzy expert system for the diagnosis of coronary artery disease

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study, we are concerned with genetically optimized fuzzy decision trees (G-DTs). Decision trees are fundamental architectures of machine learning, pattern recognition, and system modeling. Starting with the generic decision tree with discrete or interval-valued attributes, we develop its fuzzy set-based generalization. In this generalized structure we admit the values of the attributes that are represented by some membership functions. Such fuzzy decision trees are constructed in the setting of genetic optimization. The underlying genetic algorithm optimizes the parameters of the fuzzy sets associated with the individual nodes where they play a role of fuzzy "switches" by distributing a flow of processing completed within the tree. We discuss various forms of the fitness function that help capture the essence of the problem at hand (that could be either of classification nature when dealing with discrete outputs or regression-like when handling a continuous output variable). We quantify a nature of the generalization of the tree by studying an optimally adjusted spreads of the membership functions located at the nodes of the decision tree. A series of experiments exploiting synthetic and machine learning data is used to illustrate the performance of the G-DTs.