Show simple item record

dc.contributor.authorZielosko, Beata*
dc.date.accessioned2015-08-04T07:02:42Zen
dc.date.available2015-08-04T07:02:42Zen
dc.date.issued2012en
dc.identifier.isbn9783642347061en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-34707-8_35en
dc.identifier.urihttp://hdl.handle.net/10754/564505en
dc.description.abstractIn the paper, we present an algorithm for optimization of approximate decision rules relative to the number of misclassifications. The considered algorithm is based on extensions of dynamic programming and constructs a directed acyclic graph Δ β (T). Based on this graph we can describe the whole set of so-called irredundant β-decision rules. We can optimize rules from this set according to the number of misclassifications. Results of experiments with decision tables from the UCI Machine Learning Repository are presented. © 2012 Springer-Verlag.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectapproximate decision rulesen
dc.subjectdynamic programmingen
dc.subjectnumber of misclassificationsen
dc.titleOptimization of β-decision rules relative to number of misclassificationsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division*
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, Poland*
kaust.personZielosko, Beata*


This item appears in the following Collection(s)

Show simple item record