A multi-objective evolutionary approach to Pareto-optimal model trees
Marcin Czajkowski , Marek Krętowski
AbstractThis paper discusses the multi-objective evolutionary approach to induction of model trees. The model tree is a particular case of a decision tree designed to solve regression problems. Although the decision tree induction is inherently a multi-objective task, most of the conventional learning algorithms can only deal with a single objective that may possibly aggregate multiple objectives. The goal of this paper is to demonstrate how a set of non-dominated model trees can be obtained using the Global Model Tree (GMT) system. The GMT framework can be used for the evolutionary induction of different types of decision trees, including univariate, oblique or mixed; regression and model trees. Proposed Pareto approach for GMT allows the decision maker to select desired output model according to his preferences on the conflicting objectives. Performed study covers the regression trees and the model trees with two or three objectives that relate to the tree error and the tree comprehensibility. Experimental evaluation discusses the importance of multi-objective components like crowding function and archive elitist selection, using real-life datasets. Finally, the presented multi-objective GMT solution is confronted with competitive regression and model tree inducers.
|Journal series||Soft Computing, ISSN 1432-7643, e-ISSN 1433-7479, (N/A 70 pkt)|
|Publication size in sheets||0.7|
|Keywords in English||Data mining, Evolutionary algorithms, Model trees, Multi-objective optimization, Pareto optimality, Regression problem|
|ASJC Classification||; ;|
|Internal identifier||ROC 19-20|
|License||Journal (articles only); other; ; after publication|
|Score||= 70.0, 04-03-2020, ArticleFromJournal|
|Publication indicators||: 2017 = 1.11; : 2018 = 2.784 (2) - 2018=2.6 (5)|
|Citation count*||3 (2020-04-07)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.