Decision rules for decision tables with many-valued decisions

Handle URI:
http://hdl.handle.net/10754/564344
Title:
Decision rules for decision tables with many-valued decisions
Authors:
Chikalov, Igor; Zielosko, Beata
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Publisher:
Springer Science + Business Media
Journal:
Rough Sets and Knowledge Technology
Conference/Event name:
6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011
Issue Date:
2011
DOI:
10.1007/978-3-642-24425-4_95
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642244247
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorChikalov, Igoren
dc.contributor.authorZielosko, Beataen
dc.date.accessioned2015-08-04T06:24:20Zen
dc.date.available2015-08-04T06:24:20Zen
dc.date.issued2011en
dc.identifier.isbn9783642244247en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-24425-4_95en
dc.identifier.urihttp://hdl.handle.net/10754/564344en
dc.description.abstractIn 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.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectdecision rulesen
dc.subjectdecision tables with many-valued decisionsen
dc.subjectgreedy algorithmen
dc.subjectset cover problemen
dc.titleDecision rules for decision tables with many-valued decisionsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalRough Sets and Knowledge Technologyen
dc.conference.date9 October 2011 through 12 October 2011en
dc.conference.name6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011en
dc.conference.locationBanff, ABen
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzińska St., 41-200 Sosnowiec, Polanden
kaust.authorChikalov, Igoren
kaust.authorZielosko, Beataen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.