Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions

Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions

by Fawaz Alsolami, Mohammad Azad, Igor Chikalov, Mikhail Moshkov

280 pages· 2019· ISBN 9783030128548
Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
The results presented here (including the assessment of a new tool – inhibitory trees) offer valuable tools for researchers in the areas of data mining, knowledge discovery, and machine learning, especially those whose work involves decision tables with many-valued decisions. The authors consider various examples of problems and corresponding decision tables with many-valued decisions, discuss the difference between decision and inhibitory trees and rules, and develop tools for their analysis and design. Applications include the study of totally optimal (optimal in relation to a number of criteria simultaneously) decision and inhibitory trees and rules; the comparison of greedy heuristics for tree and rule construction as single-criterion and bi-criteria optimization algorithms; and the development of a restricted multi-pruning approach used in classification and knowledge representation.

Discuss Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions with other readers

Join or start a book club for Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions?

Sign up free on Readfeed, then browse public clubs or start your own club with Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.