Combinatorial machine learning. A rough set approach.
From MaRDI portal
Publication:545918
DOI10.1007/978-3-642-20995-6zbMath1246.68010OpenAlexW2499258091MaRDI QIDQ545918
Beata Zielosko, Mikhail Ju. 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
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)
Related Items (13)
On Combining Discretisation Parameters and Attribute Ranking for Selection of Decision Rules ⋮ Three Approaches to Deal with Tests for Inconsistent Decision Tables – Comparative Study ⋮ Sequential Optimization of $$\gamma $$-Decision Rules Relative to Length, Coverage and Number of Misclassifications ⋮ Time and space complexity of deterministic and nondeterministic decision trees ⋮ Totally optimal decision rules ⋮ Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions ⋮ Heuristic-based feature selection for rough set approach ⋮ A novel incremental attribute reduction approach for dynamic incomplete decision systems ⋮ Bi-criteria optimization problems for decision rules ⋮ On \((I_O,O)\)-fuzzy rough sets based on overlap functions ⋮ Bi-criteria optimization of decision trees with applications to data analysis ⋮ On the relation between rough set reducts and typical testors ⋮ Rough Sets: From Rudiments to Challenges
This page was built for publication: Combinatorial machine learning. A rough set approach.
