Bi-criteria optimization of decision trees with applications to data analysis
DOI10.1016/j.ejor.2017.10.021zbMath1403.91106OpenAlexW2766402906MaRDI QIDQ1754136
Igor Chikalov, Shahid Hussain, Mikhail Ju. Moshkov
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10754/625914
heuristicsdynamic programmingmultiple criteria analysisdecision treesbicriteria optimizationPareto optimal points
Programming involving graphs or networks (90C35) Decision theory (91B06) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision trees with minimum average depth for sorting eight elements
- Totally optimal decision trees for Boolean functions
- Innovations in intelligent machines. 4. Recent advances in knowledge engineering
- Combinatorial machine learning. A rough set approach.
- Pareto-optimality of oblique decision trees from evolutionary algorithms
- Rudiments of rough sets
- Constructing optimal binary decision trees is NP-complete
- Rough set approach to multi-attribute decision analysis
- Trading accuracy for simplicity in decision trees
- A general decomposition approach for multi-criteria decision trees
- On the class of restricted linear information systems
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- The synthetic approach to decision table conversion
- Optimizing decision trees through heuristically guided search
- Data Mining with Decision Trees
- Transactions on Rough Sets III
- Optimal Binary Identification Procedures
- The elements of statistical learning. Data mining, inference, and prediction
- Applying decision tree methodology for rules extraction under cognitive constraints.
This page was built for publication: Bi-criteria optimization of decision trees with applications to data analysis