Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions

Mohammad Azad, Mikhail Moshkov, Beata Zielosko

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To illustrate proposed approach we study a problem of recognition of labels of points in the plain. This paper contains also results of experiments with modified decision tables from UCI Machine Learning Repository.
Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science
PublisherSpringer Nature
Pages24-50
Number of pages27
ISBN (Print)9783662536100
DOIs
StatePublished - Oct 21 2016

Fingerprint Dive into the research topics of 'Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions'. Together they form a unique fingerprint.

Cite this