Show simple item record

dc.contributor.author Cuzzocrea, Alfredo
dc.contributor.author Leung, Carson K.
dc.contributor.author MacKinnon, Richard Kyle
dc.date.accessioned 2016-03-08T21:50:38Z
dc.date.available 2016-03-08T21:50:38Z
dc.date.issued 2015
dc.identifier.citation A. Cuzzocrea, C.K. Leung, R.K. MacKinnon. Approximation to expected support of frequent itemsets in mining probabilistic sets of uncertain data. Procedia Computer Science, 60 (2015), pp. 613-622 en_US
dc.identifier.uri http://hdl.handle.net/1993/31150
dc.description A. Cuzzocrea, C.K. Leung, R.K. MacKinnon. Approximation to expected support of frequent itemsets in mining probabilistic sets of uncertain data. Procedia Computer Science, 60 (2015), pp. 613-622. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). en_US
dc.description.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. en_US
dc.description.sponsorship Natural Sciences and Engineering Research Council of Canada (NSERC); University of Manitoba en_US
dc.language.iso en en_US
dc.publisher Elsevier en_US
dc.subject knowledge discovery and data mining en_US
dc.subject expected support en_US
dc.subject frequent patterns en_US
dc.subject uncertain data en_US
dc.subject upper bounds en_US
dc.title Approximation to expected support of frequent itemsets in mining probabilistic sets of uncertain data en_US
dc.type Article en_US
dc.identifier.doi http://dx.doi.org/10.1016/j.procs.2015.08.195


Files in this item

This item appears in the following Collection(s)

  • Research Publications [1141]
    This collection contains full text research publications authored or co-authored by University of Manitoba researchers.

Show simple item record

View Statistics