Bi-criteria optimization problems for decision rules
DOI10.1007/s10479-018-2905-0zbMath1434.68184OpenAlexW2805278717WikidataQ129731480 ScholiaQ129731480MaRDI QIDQ1730539
Igor Chikalov, Fawaz Alsolami, Talha Amin, Mikhail Ju. Moshkov
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10754/628274
dynamic programminggreedy heuristicsPareto-optimal pointsdecision tables with many-valued decisionssystems of decision rules
Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial machine learning. A rough set approach.
- Logical analysis of data -- an overview: from combinatorial optimization to medical applications
- Rough sets and Boolean reasoning
- Separate-and-conquer rule learning
- Pareto-optimal patterns in logical analysis of data
- On the class of restricted linear information systems
- Maximum patterns in datasets
- Dynamic programming approach to optimization of approximate decision rules
- Foundations of Rule Learning
- Explicit Feature Construction and Manipulation for Covering Rule Learning Algorithms
- Rough sets theory for multicriteria decision analysis
This page was built for publication: Bi-criteria optimization problems for decision rules