• Login
    View Item 
    •   Home
    • Research
    • Book Chapters
    • View Item
    •   Home
    • Research
    • Book Chapters
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Book Chapter
    Authors
    Azad, Mohammad cc
    Moshkov, Mikhail cc
    Zielosko, Beata
    KAUST Department
    Applied Mathematics and Computational Science Program
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2016-10-21
    Online Publication Date
    2016-10-21
    Print Publication Date
    2016
    Permanent link to this record
    http://hdl.handle.net/10754/622200
    
    Metadata
    Show full item record
    Abstract
    The paper is devoted to the study of a greedy algorithm for construction of approximate decision rules. This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the length of rules. To illustrate proposed approach we study a problem of recognition of labels of points in the plain. This paper contains also results of experiments with modified decision tables from UCI Machine Learning Repository.
    Citation
    Azad M, Moshkov M, Zielosko B (2016) Greedy Algorithm for the Construction of Approximate Decision Rules for Decision Tables with Many-Valued Decisions. Lecture Notes in Computer Science: 24–50. Available: http://dx.doi.org/10.1007/978-3-662-53611-7_2.
    Sponsors
    Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST). The authors wish to express their gratitude to anonymous reviewers for useful comments.
    Publisher
    Springer Nature
    Journal
    Lecture Notes in Computer Science
    DOI
    10.1007/978-3-662-53611-7_2
    Additional Links
    http://link.springer.com/chapter/10.1007%2F978-3-662-53611-7_2
    ae974a485f413a2113503eed53cd6c53
    10.1007/978-3-662-53611-7_2
    Scopus Count
    Collections
    Applied Mathematics and Computational Science Program; Computer Science Program; Book Chapters; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.