Finding efficiencies in frequent pattern mining from big uncertain data

Abstract

Many existing data mining algorithms search interesting patterns from transactional databases of precise data. However, there are situations in which data are uncertain. Items in each transaction of these probabilistic databases of uncertain data are usually associated with existential probabilities, which express the likelihood of these items to be present in the transaction. When compared with mining from precise data, the search space for mining from uncertain data is much larger due to the presence of the existential probabilities. This problem is worsened as we are moving to the era of Big data. Furthermore, in many real-life applications, users may be interested in a tiny portion of this large search space for Big data mining. Without providing opportunities for users to express the interesting patterns to be mined, many existing data mining algorithms return numerous patterns—out of which only some are interesting. In this article, we propose an algorithm that allows users to express their interest in terms of constraints, uses the MapReduce model to mine uncertain Big data for frequent patterns that satisfy the user-specified anti-monotone and monotone constraints, as well as balance the load.

DOI: 10.1007/s11280-016-0411-3

6 Figures and Tables

Cite this paper

@article{Leung2016FindingEI, title={Finding efficiencies in frequent pattern mining from big uncertain data}, author={Carson Kai-Sang Leung and Richard Kyle MacKinnon and Fan Jiang}, journal={World Wide Web}, year={2016}, volume={20}, pages={571-594} }