Pareto-optimality of oblique decision trees from evolutionary algorithms

DOI10.1007/s10898-010-9614-9zbMath1230.90171OpenAlexW2024460108MaRDI QIDQ652680

Jose Maria Pangilinan, Gerrit K. Janssens

Publication date: 15 December 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9614-9

zbMATH Keywords

classificationmultiobjective optimizationdata miningevolutionary algorithmdecision treePareto-optimality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Mathematical optimization in classification and regression trees ⋮ Bi-criteria optimization of decision trees with applications to data analysis

Uses Software

• SPEA2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An experimental evaluation of some classification methods
• Data mining with genetic algorithms on binary trees.
• Evaluation of decision trees: a multi-criteria approach
• A hybrid method for solving multi-objective global optimization problems
• A survey of recent developments in multiobjective optimization
• Oblique Multicategory Decision Trees Using Nonlinear Programming
• Analysis and Design of a Decision Tree Based on Entropy Reduction and Its Application to Large Character Set Recognition
• Tree-Structured Classification Via Generalized Discriminant Analysis

This page was built for publication: Pareto-optimality of oblique decision trees from evolutionary algorithms