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

Mohammad Azad; Igor Chikalov; Mikhail Moshkov; Beata Zielosko

doi:10.3233/FI-2012-759

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

Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) 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 cardinality of tests.

Original language	English (US)
Pages (from-to)	231-242
Number of pages	12
Journal	Fundamenta Informaticae
Volume	120
Issue number	3-4
DOIs	https://doi.org/10.3233/FI-2012-759
State	Published - Dec 14 2012

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01

ASJC Scopus subject areas

Computational Theory and Mathematics
Algebra and Number Theory
Theoretical Computer Science
Information Systems

Access to Document

10.3233/FI-2012-759

Cite this

@article{e062e1d7dc6e4cfab4b5e1bb0f9dd2a0,

title = "Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions",

abstract = "The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) 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 cardinality of tests.",

author = "Mohammad Azad and Igor Chikalov and Mikhail Moshkov and Beata Zielosko",

note = "KAUST Repository Item: Exported on 2020-10-01",

year = "2012",

month = dec,

day = "14",

doi = "10.3233/FI-2012-759",

language = "English (US)",

volume = "120",

pages = "231--242",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press",

number = "3-4",

}

TY - JOUR

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

AU - Azad, Mohammad

AU - Chikalov, Igor

AU - Moshkov, Mikhail

AU - Zielosko, Beata

N1 - KAUST Repository Item: Exported on 2020-10-01

PY - 2012/12/14

Y1 - 2012/12/14

N2 - The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) 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 cardinality of tests.

AB - The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts) 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 cardinality of tests.

UR - http://hdl.handle.net/10754/564642

UR - https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/FI-2012-759

UR - http://www.scopus.com/inward/record.url?scp=84870788311&partnerID=8YFLogxK

U2 - 10.3233/FI-2012-759

DO - 10.3233/FI-2012-759

M3 - Article

SN - 0169-2968

VL - 120

SP - 231

EP - 242

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 3-4

ER -

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

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this