Construction of α-decision trees for tables with many-valued decisions

Mikhail Moshkov; Beata Zielosko

doi:10.1007/978-3-642-24425-4_63

Construction of α-decision trees for tables with many-valued decisions

Mikhail Moshkov, Beata Zielosko

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Scopus citations

Abstract

The paper is devoted to the study of greedy algorithm for construction of approximate decision trees (α-decision trees). 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 bound on the number of algorithm steps, and bound on the algorithm accuracy relative to the depth of decision trees. © 2011 Springer-Verlag.

Original language	English (US)
Title of host publication	Rough Sets and Knowledge Technology
Publisher	Springer Nature
Pages	486-494
Number of pages	9
ISBN (Print)	9783642244247
DOIs	https://doi.org/10.1007/978-3-642-24425-4_63
State	Published - 2011

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-24425-4_63

Cite this

@inproceedings{086c612315e84aca9c356bc4cb3e2a0d,

title = "Construction of α-decision trees for tables with many-valued decisions",

abstract = "The paper is devoted to the study of greedy algorithm for construction of approximate decision trees (α-decision trees). 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 bound on the number of algorithm steps, and bound on the algorithm accuracy relative to the depth of decision trees. {\textcopyright} 2011 Springer-Verlag.",

author = "Mikhail Moshkov and Beata Zielosko",

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

year = "2011",

doi = "10.1007/978-3-642-24425-4_63",

language = "English (US)",

isbn = "9783642244247",

pages = "486--494",

booktitle = "Rough Sets and Knowledge Technology",

publisher = "Springer Nature",

}

TY - GEN

T1 - Construction of α-decision trees for tables with many-valued decisions

AU - Moshkov, Mikhail

AU - Zielosko, Beata

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

PY - 2011

Y1 - 2011

N2 - The paper is devoted to the study of greedy algorithm for construction of approximate decision trees (α-decision trees). 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 bound on the number of algorithm steps, and bound on the algorithm accuracy relative to the depth of decision trees. © 2011 Springer-Verlag.

AB - The paper is devoted to the study of greedy algorithm for construction of approximate decision trees (α-decision trees). 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 bound on the number of algorithm steps, and bound on the algorithm accuracy relative to the depth of decision trees. © 2011 Springer-Verlag.

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

UR - http://link.springer.com/10.1007/978-3-642-24425-4_63

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

U2 - 10.1007/978-3-642-24425-4_63

DO - 10.1007/978-3-642-24425-4_63

M3 - Conference contribution

SN - 9783642244247

SP - 486

EP - 494

BT - Rough Sets and Knowledge Technology

PB - Springer Nature

ER -

Construction of α-decision trees for tables with many-valued decisions

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this