Skip to main content
Article thumbnail
Location of Repository

Computing theoretically-sound upper bounds to expected support for frequent pattern mining problems over uncertain big data

By Alfredo Massimiliano Cuzzocrea and Carson K. Leung


Frequent pattern mining aims to discover implicit, previously unknown, and potentially useful knowledge in the form of sets of frequently co-occurring items, events, or objects. To mine frequent patterns from probabilistic datasets of uncertain data, where each item in a transaction is usually associated with an existential probability expressing the likelihood of its presence in that transaction, the UF-growth algorithm captures important information about uncertain data in a UF-tree structure so that expected support can be computed for each pattern. A pattern is considered frequent if its expected support meets or exceeds the user-specified threshold. However, a challenge is that the UF-tree can be large. To handle this challenge, several algorithms use smaller trees such that upper bounds to expected support can be computed. In this paper, we examine these upper bounds, and determine which ones provide tighter upper bounds to expected support for frequent pattern mining of uncertain big data

Topics: Big data, Data analysis, Data mining, Data science, Uncertainty, Computer Science (all)
Publisher: Springer Verlag
Year: 2016
DOI identifier: 10.1007/978-3-319-40581-0_31
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.