Length and coverage of inhibitory decision rules

Handle URI:
http://hdl.handle.net/10754/564503
Title:
Length and coverage of inhibitory decision rules
Authors:
Alsolami, Fawaz ( 0000-0001-5858-4908 ) ; Chikalov, Igor; Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Zielosko, Beata
Abstract:
Authors present algorithms for optimization of inhibitory rules relative to the length and coverage. Inhibitory rules have a relation "attribute ≠ value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. Paper contains also comparison of length and coverage of inhibitory rules constructed by a greedy algorithm and by the dynamic programming algorithm. © 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:
Computational Collective Intelligence. Technologies and Applications
Conference/Event name:
4th International Conference on Computational Collective Intelligence, ICCCI 2012
Issue Date:
2012
DOI:
10.1007/978-3-642-34707-8_33
Type:
Conference Paper
ISSN:
03029743
ISBN:
9783642347061
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:39Zen
dc.date.available2015-08-04T07:02:39Zen
dc.date.issued2012en
dc.identifier.isbn9783642347061en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-34707-8_33en
dc.identifier.urihttp://hdl.handle.net/10754/564503en
dc.description.abstractAuthors present algorithms for optimization of inhibitory rules relative to the length and coverage. Inhibitory rules have a relation "attribute ≠ value" on the right-hand side. The considered algorithms are based on extensions of dynamic programming. Paper contains also comparison of length and coverage of inhibitory rules constructed by a greedy algorithm and by the dynamic programming algorithm. © 2012 Springer-Verlag.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectcoverageen
dc.subjectdynamic programmingen
dc.subjectinhibitory decision rulesen
dc.subjectlengthen
dc.titleLength and coverage of inhibitory decision rulesen
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.journalComputational Collective Intelligence. Technologies and Applicationsen
dc.conference.date28 November 2012 through 30 November 2012en
dc.conference.name4th International Conference on Computational Collective Intelligence, ICCCI 2012en
dc.conference.locationHo Chi Minh Cityen
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.