• 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

    An algorithm for reduct cardinality minimization

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    AbouEisha, Hassan M. cc
    Al Farhan, Mohammed cc
    Chikalov, Igor
    Moshkov, Mikhail cc
    KAUST Department
    Applied Mathematics and Computational Science Program
    Computational Bioscience Research Center (CBRC)
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
    Office of the VP
    Date
    2013-12
    Permanent link to this record
    http://hdl.handle.net/10754/564824
    
    Metadata
    Show full item record
    Abstract
    This is devoted to the consideration of a new algorithm for reduct cardinality minimization. This algorithm transforms the initial table to a decision table of a special kind, simplify this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. Results of computer experiments with decision tables from UCI ML Repository are discussed. © 2013 IEEE.
    Citation
    AbouEisha, H., Farhan, M. A., Chikalov, I., & Moshkov, M. (2013). An algorithm for reduct cardinality minimization. 2013 IEEE International Conference on Granular Computing (GrC). doi:10.1109/grc.2013.6740370
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2013 IEEE International Conference on Granular Computing (GrC)
    Conference/Event name
    2013 IEEE International Conference on Granular Computing, GrC 2013
    ISBN
    9781479912810
    DOI
    10.1109/GrC.2013.6740370
    ae974a485f413a2113503eed53cd6c53
    10.1109/GrC.2013.6740370
    Scopus Count
    Collections
    Conference Papers; Applied Mathematics and Computational Science Program; Computer Science Program; Computational Bioscience Research Center (CBRC); 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.