Combinatorial machine learning. A rough set approach.
From MaRDI portal
Recommendations
Cited in
(15)- On \((I_O,O)\)-fuzzy rough sets based on overlap functions
- Rough Sets: From Rudiments to Challenges
- Bi-criteria optimization problems for decision rules
- Sequential optimization of \(\gamma \)-decision rules relative to length, coverage and number of misclassifications
- Time and space complexity of deterministic and nondeterministic decision trees
- A novel incremental attribute reduction approach for dynamic incomplete decision systems
- Decision trees versus systems of decision rules. A rough set approach
- Heuristic-based feature selection for rough set approach
- Totally optimal decision rules
- Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions
- Three approaches to deal with tests for inconsistent decision tables -- comparative study
- Partial covers, reducts and decision rules in rough sets. Theory and applications
- Bi-criteria optimization of decision trees with applications to data analysis
- On Combining Discretisation Parameters and Attribute Ranking for Selection of Decision Rules
- On the relation between rough set reducts and typical testors
This page was built for publication: Combinatorial machine learning. A rough set approach.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545918)