Optimization of inhibitory decision rules relative to length and coverage

Handle URI:
http://hdl.handle.net/10754/564492
Title:
Optimization of inhibitory decision rules relative to length and coverage
Authors:
Alsolami, Fawaz ( 0000-0001-5858-4908 ) ; Chikalov, Igor; Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Zielosko, Beata
Abstract:
The paper is devoted to the study of algorithms for optimization of inhibitory rules relative to the length and coverage. In contrast with usual rules that have on the right-hand side a relation "attribute ≠ value", inhibitory rules have a relation "attribute = value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. © 2012 Springer-Verlag.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Publisher:
Springer Science + Business Media
Journal:
Rough Sets and Knowledge Technology
Conference/Event name:
7th International Conference on Rough Sets and Knowledge Technology, RSKT 2012
Issue Date:
2012
DOI:
10.1007/978-3-642-31900-6_19
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642318993
Appears in Collections:
Conference Papers; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAlsolami, Fawazen
dc.contributor.authorChikalov, Igoren
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorZielosko, Beataen
dc.date.accessioned2015-08-04T07:02:22Zen
dc.date.available2015-08-04T07:02:22Zen
dc.date.issued2012en
dc.identifier.isbn9783642318993en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-31900-6_19en
dc.identifier.urihttp://hdl.handle.net/10754/564492en
dc.description.abstractThe paper is devoted to the study of algorithms for optimization of inhibitory rules relative to the length and coverage. In contrast with usual rules that have on the right-hand side a relation "attribute ≠ value", inhibitory rules have a relation "attribute = value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. © 2012 Springer-Verlag.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectcoverageen
dc.subjectdynamic programmingen
dc.subjectinhibitory decision rulesen
dc.subjectlengthen
dc.titleOptimization of inhibitory decision rules relative to length and coverageen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.identifier.journalRough Sets and Knowledge Technologyen
dc.conference.date17 August 2012 through 20 August 2012en
dc.conference.name7th International Conference on Rough Sets and Knowledge Technology, RSKT 2012en
dc.conference.locationChengduen
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Bȩdzińska St., 41-200 Sosnowiec, Polanden
kaust.authorAlsolami, Fawazen
kaust.authorChikalov, Igoren
kaust.authorMoshkov, Mikhailen
kaust.authorZielosko, Beataen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.