A Review of Frequent Pattern Mining Algorithms for Uncertain Data

N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Frequent pattern mining plays an essential role in data mining (e.g. finding association rules, correlation, sequences, and episodes). Uncertainty in data is generally caused by factors like data randomness and incompleteness, limitations of measuring equipment, delayed data updates, etc. Some of the important algorithms in finding all the frequent patterns from probabilistic datasets of uncertain data are U-Apriori, UF-growth, CUF-growth, PUF-growth. When users are only interested in some of the frequent patterns rather than all, these interests are expressed in terms of constraints and are pushed into mining process there by reducing search space. Finally big data era has brought challenges as well as tools for the problem of frequent pattern mining of uncertain data. In this paper all the above issues are briefly discussed and summarized.

Cite

CITATION STYLE

APA

Bhogadhi, V., & Chandak, M. B. (2018). A Review of Frequent Pattern Mining Algorithms for Uncertain Data. In Lecture Notes in Networks and Systems (Vol. 16, pp. 974–983). Springer. https://doi.org/10.1007/978-3-319-56991-8_73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free