Decision rules for decision tables with many-valued decisions

Igor Chikalov; Beata Zielosko

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

Decision rules for decision tables with many-valued decisions

Igor Chikalov, Beata Zielosko

Computer, Electrical and Mathematical Sciences and Engineering

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

6 Scopus citations

Abstract

In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. © 2011 Springer-Verlag.

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

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

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

Cite this

@inproceedings{2e0e2077c73c411aa83ee86b928ff30c,

title = "Decision rules for decision tables with many-valued decisions",

abstract = "In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. {\textcopyright} 2011 Springer-Verlag.",

author = "Igor Chikalov and Beata Zielosko",

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

year = "2011",

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

language = "English (US)",

isbn = "9783642244247",

pages = "763--768",

booktitle = "Rough Sets and Knowledge Technology",

publisher = "Springer Nature",

}

TY - GEN

T1 - Decision rules for decision tables with many-valued decisions

AU - Chikalov, Igor

AU - Zielosko, Beata

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

PY - 2011

Y1 - 2011

N2 - In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. © 2011 Springer-Verlag.

AB - In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. © 2011 Springer-Verlag.

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

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

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

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

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

M3 - Conference contribution

SN - 9783642244247

SP - 763

EP - 768

BT - Rough Sets and Knowledge Technology

PB - Springer Nature

ER -

Decision rules for decision tables with many-valued decisions

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this