MURAL - Maynooth University Research Archive Library



    A Fast Minimal Infrequent Itemset Mining Algorithm


    Share and Export

    Demchuk, Kostiantyn (2014) A Fast Minimal Infrequent Itemset Mining Algorithm. Masters thesis, National University of Ireland Maynooth.

    [thumbnail of Research Master Thesis by Kostiantyn Demchuk May 2014.pdf]
    Preview
     Text
    Available under License Creative Commons Attribution Non-commercial Share Alike.
    Download (1MB) | Preview

    Abstract

    A novel fast algorithm for finding quasi identifiers in large datasets is presented. Performance measurements on a broad range of datasets demonstrate substantial reductions in run-time relative to the state of the art and the scalability of the algorithm to realistically-sized datasets up to several million records.
    Item Type: Thesis (Masters)
    Keywords: itemset mining; breadth-first algorithm; frequency-based analysis; k-anonymity; performance; load balancing;
    Academic Unit: Faculty of Science and Engineering > Research Institutes > Hamilton Institute
    Item ID: 6325
    Depositing User: IR eTheses
    Date Deposited: 04 Sep 2015 09:54
    Funders: Science Foundation Ireland under Grant No. 11/PI/1177
    Use Licence: This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

    Downloads

    Downloads per month over past year

    Origin of downloads

    Repository Staff Only (login required)

    Item control page
    Item control page
    MURAL - Maynooth University Research Archive Library is powered by EPrints 3.4 which is developed by the School of Electronics and Computer Science at the University of Southampton. About EPrints | Accessibility