Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions

DOI10.3233/FI-2012-759MaRDI QIDQ4902317zbMATH OpenOpenAlexFDO

Authors Mohammad Azad, Igor Chikalov, Beata Zielosko, Mikhail Moshkov

Publication date 14 January 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2012-759

zbMATH Keywords

decision table with many-valued decisionsgreedy algorithmreductset cover problemtest

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Greedy algorithm for the construction of approximate decision rules for decision tables with many-valued decisions
• A greedy algorithm for construction of decision trees for tables with many-valued decisions -- a comparative study
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Rough Sets and Current Trends in Computing
• Transactions on Rough Sets I

Cited in

(6)

• An algorithm for constructing irredundant tests for binary tables
• Greedy algorithm for the construction of approximate decision rules for decision tables with many-valued decisions
• Three approaches to deal with tests for inconsistent decision tables -- comparative study
• scientific article; zbMATH DE number 3609171 (Why is no real title available?)
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• A greedy algorithm for construction of decision trees for tables with many-valued decisions -- a comparative study

This page was built for publication: Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902317)