• Libraries
    • Log in to:
    View Item 
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Approximation to expected support of frequent itemsets in mining probabilistic sets of uncertain data

    Thumbnail
    View/Open
    Cuzzocrea_Leung_JProCS60_2015.pdf (344.6Kb)
    Date
    2015
    Author
    Cuzzocrea, Alfredo
    Leung, Carson K.
    MacKinnon, Richard Kyle
    Metadata
    Show full item record
    Abstract
    Knowledge discovery and data mining generally discovers implicit, previously unknown, and useful knowledge from data. As one of the popular knowledge discovery and data mining tasks, frequent itemset mining, in particular, discovers knowledge in the form of sets of frequently co-occurring items, events, or objects. On the one hand, in many real-life applications, users mine frequent patterns from traditional databases of precise data, in which users know certainly the presence of items in transactions. On the other hand, in many other real-life applications, users mine frequent itemsets from probabilistic sets of uncertain data, in which users are uncertain about the likelihood of the presence of items in transactions. Each item in these probabilistic sets of uncertain data is often associated with an existential probability expressing the likelihood of its presence in that transaction. To mine frequent itemsets from these probabilistic datasets, many existing algorithms capture lots of information to compute expected support. To reduce the amount of space required, algorithms capture some but not all information in computing or approximating expected support. The tradeoff is that the upper bounds to expected support may not be tight. In this paper, we examine several upper bounds and recommend to the user which ones consume less space while providing good approximation to expected support of frequent itemsets in mining probabilistic sets of uncertain data.
    URI
    http://hdl.handle.net/1993/31150
    DOI
    10.1016/j.procs.2015.08.195
    Collections
    • Faculty of Science Scholarly Works [209]
    • University of Manitoba Scholarship [1981]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of MSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV