• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • 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

    Length and coverage of inhibitory decision rules

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Alsolami, Fawaz cc
    Chikalov, Igor
    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
    Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
    Date
    2012
    Permanent link to this record
    http://hdl.handle.net/10754/564503
    
    Metadata
    Show full item record
    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.
    Citation
    Alsolami, F., Chikalov, I., Moshkov, M., & Zielosko, B. M. (2012). Length and Coverage of Inhibitory Decision Rules. Lecture Notes in Computer Science, 325–334. doi:10.1007/978-3-642-34707-8_33
    Publisher
    Springer Nature
    Journal
    Computational Collective Intelligence. Technologies and Applications
    Conference/Event name
    4th International Conference on Computational Collective Intelligence, ICCCI 2012
    ISBN
    9783642347061
    DOI
    10.1007/978-3-642-34707-8_33
    ae974a485f413a2113503eed53cd6c53
    10.1007/978-3-642-34707-8_33
    Scopus Count
    Collections
    Conference Papers; Applied Mathematics and Computational Science Program; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  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.