Show simple item record

dc.contributor.authorAmin, Talha M.
dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2017-11-30T07:06:49Z
dc.date.available2017-11-30T07:06:49Z
dc.date.issued2017-11-22
dc.identifier.citationAmin T, Moshkov M (2017) Totally optimal decision rules. Discrete Applied Mathematics. Available: http://dx.doi.org/10.1016/j.dam.2017.10.024.
dc.identifier.issn0166-218X
dc.identifier.doi10.1016/j.dam.2017.10.024
dc.identifier.urihttp://hdl.handle.net/10754/626257
dc.description.abstractOptimality of decision rules (patterns) can be measured in many ways. One of these is referred to as length. Length signifies the number of terms in a decision rule and is optimally minimized. Another, coverage represents the width of a rule’s applicability and generality. As such, it is desirable to maximize coverage. A totally optimal decision rule is a decision rule that has the minimum possible length and the maximum possible coverage. This paper presents a method for determining the presence of totally optimal decision rules for “complete” decision tables (representations of total functions in which different variables can have domains of differing values). Depending on the cardinalities of the domains, we can either guarantee for each tuple of values of the function that totally optimal rules exist for each row of the table (as in the case of total Boolean functions where the cardinalities are equal to 2) or, for each row, we can find a tuple of values of the function for which totally optimal rules do not exist for this row.
dc.description.sponsorshipResearch reported in this publication was supported by King Abdullah University of Science and Technology (KAUST) . The authors are grateful to the anonymous reviewer for useful comments and suggestions.
dc.publisherElsevier BV
dc.relation.urlhttp://www.sciencedirect.com/science/article/pii/S0166218X17304791
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Discrete Applied Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Discrete Applied Mathematics, [, , (2017-11-22)] DOI: 10.1016/j.dam.2017.10.024 . © 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectDecision rules
dc.subjectPatterns
dc.subjectLength
dc.subjectCoverage
dc.titleTotally optimal decision rules
dc.typeArticle
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalDiscrete Applied Mathematics
dc.eprint.versionPost-print
kaust.personAmin, Talha
kaust.personMoshkov, Mikhail
refterms.dateFOA2019-11-22T00:00:00Z
dc.date.published-online2017-11-22
dc.date.published-print2018-02


Files in this item

Thumbnail
Name:
TotOpt_3.pdf
Size:
238.9Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record