Partial covers, reducts and decision rules in rough sets. Theory and applications

DOI10.1007/978-3-540-69029-0zbMath1158.68045OpenAlexW4230857996MaRDI QIDQ933600

Marcin Piliszczuk, Mikhail Ju. Moshkov, Beata Zielosko

Publication date: 22 July 2008

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69029-0

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) 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 (8)

Decision bireducts and decision reducts -- a comparison ⋮ 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 ⋮ Rseslib 3: Open Source Library of Rough Set and Machine Learning Methods ⋮ Totally optimal decision rules ⋮ On Generalized Decision Functions: Reducts, Networks and Ensembles ⋮ Rough Sets: From Rudiments to Challenges

This page was built for publication: Partial covers, reducts and decision rules in rough sets. Theory and applications