Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions
From MaRDI portal
Publication:1694833
DOI10.1016/j.ejor.2017.06.026zbMath1380.91054OpenAlexW2624753736MaRDI QIDQ1694833
Mohammad Azad, Mikhail Ju. Moshkov
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10754/625062
Decision theory (91B06) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items (3)
A novel three-way decision model with DEA method ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ Optimization problems for machine learning: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Totally optimal decision trees for Boolean functions
- Combinatorial machine learning. A rough set approach.
- Inhibitory rules in data analysis. A rough set approach
- Maximal consistent extensions of information systems relative to their theories
- Constructing optimal binary decision trees is NP-complete
- Linear probing and graphs
- Rough set approach to knowledge-based decision support
- Rough sets and concurrency
- Rough set approach to multi-attribute decision analysis
- A general decomposition approach for multi-criteria decision trees
- On the class of restricted linear information systems
- Three Approaches to Deal with Tests for Inconsistent Decision Tables – Comparative Study
- Quality of Rough Approximation in Multi-criteria Classification Problems
- Optimization and analysis of decision trees and rules: dynamic programming approach
- On Optimization of Decision Trees
- Optimal Binary Identification Procedures
- Applying decision tree methodology for rules extraction under cognitive constraints.
This page was built for publication: Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions
