• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • 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 LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Comparison of Heuristics for Optimization of Association Rules

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Fawaz_FI_B2018Revised (2).pdf
    Size:
    228.4Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Article
    Authors
    Alsolami, Fawaz cc
    Amin, Talha M. cc
    Moshkov, Mikhail cc
    Zielosko, Beata
    Żabiński, Krzysztof
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Applied Mathematics and Computational Science Program
    Date
    2019-03-22
    Online Publication Date
    2019-03-22
    Print Publication Date
    2019-03-14
    Permanent link to this record
    http://hdl.handle.net/10754/631800
    
    Metadata
    Show full item record
    Abstract
    In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference between length of rules constructed by the best heuristic and minimum length of rules is at most 4%. The same situation is with coverage.
    Citation
    Fawaz Alsolami, Talha Amin, Mikhail Moshkov, Beata Zielosko, Krzysztof Żabiński. Comparison of Heuristics for Optimization of Association Rules. FI. IOS Press; 2019;166: 1–14. doi:10.3233/FI-2019-1791
    Sponsors
    Research reported in this publication was supported by the King Abdullah University of Science and Technology (KAUST) and University of Silesia in Katowice.
    Publisher
    IOS Press
    Journal
    Fundamenta Informaticae
    DOI
    10.3233/FI-2019-1791
    Additional Links
    https://content.iospress.com/articles/fundamenta-informaticae/fi1791
    ae974a485f413a2113503eed53cd6c53
    10.3233/FI-2019-1791
    Scopus Count
    Collections
    Articles; Applied Mathematics and Computational Science Program; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2021  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    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.