Combinatorial machine learning. A rough set approach.
DOI10.1007/978-3-642-20995-6zbMATH Open1246.68010OpenAlexW2499258091MaRDI QIDQ545918FDOQ545918
Authors: Beata Zielosko, Mikhail Moshkov 
Publication date: 24 June 2011
Published in: Studies in Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20995-6
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
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)
