• 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

    Comparison of Heuristics for Inhibitory Rule Optimization

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1-s2.0-S1877050914010837-main.pdf
    Size:
    200.9Kb
    Format:
    PDF
    Description:
    Main article
    Download
    Type
    Conference Paper
    Authors
    Alsolami, Fawaz cc
    Chikalov, Igor
    Moshkov, Mikhail cc
    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
    2014-09-13
    Online Publication Date
    2014-09-13
    Print Publication Date
    2014
    Permanent link to this record
    http://hdl.handle.net/10754/550701
    
    Metadata
    Show full item record
    Abstract
    Knowledge representation and extraction are very important tasks in data mining. In this work, we proposed a variety of rule-based greedy algorithms that able to obtain knowledge contained in a given dataset as a series of inhibitory rules containing an expression “attribute ≠ value” on the right-hand side. The main goal of this paper is to determine based on rule characteristics, rule length and coverage, whether the proposed rule heuristics are statistically significantly different or not; if so, we aim to identify the best performing rule heuristics for minimization of rule length and maximization of rule coverage. Friedman test with Nemenyi post-hoc are used to compare the greedy algorithms statistically against each other for length and coverage. The experiments are carried out on real datasets from UCI Machine Learning Repository. For leading heuristics, the constructed rules are compared with optimal ones obtained based on dynamic programming approach. The results seem to be promising for the best heuristics: the average relative difference between length (coverage) of constructed and optimal rules is at most 2.27% (7%, respectively). Furthermore, the quality of classifiers based on sets of inhibitory rules constructed by the considered heuristics are compared against each other, and the results show that the three best heuristics from the point of view classification accuracy coincides with the three well-performed heuristics from the point of view of rule length minimization.
    Citation
    Comparison of Heuristics for Inhibitory Rule Optimization 2014, 35:378 Procedia Computer Science
    Publisher
    Elsevier BV
    Journal
    Procedia Computer Science
    Conference/Event name
    International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2014
    DOI
    10.1016/j.procs.2014.08.118
    Additional Links
    http://linkinghub.elsevier.com/retrieve/pii/S1877050914010837
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.procs.2014.08.118
    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-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.