Mining constrained frequent itemsets from distributed uncertain data

作者：Cuzzocrea Alfredo; Leung Carson Kai Sang^*; MacKinnon Richard Kyle

来源：Future Generation Computer Systems-The International Journal of eScience, 2014, 37: 117-126.

DOI：10.1016/j.future.2013.10.026

• Data mining
• Frequent pattern mining
• Advanced data-intensive computing algorithms
• Constraints
• Distributed computing

Nowadays, high volumes of massive data can be generated from various sources (e.g., sensor data from environmental surveillance). Many existing distributed frequent itemset mining algorithms do not allow users to express the itemsets to be mined according to their intention via the use of constraints. Consequently, these unconstrained mining algorithms can yield numerous itemsets that are not interesting to users. Moreover, due to inherited measurement inaccuracies and/or network latencies, the data are often riddled with uncertainty. These call for both constrained mining and uncertain data mining. In this journal article, we propose a data-intensive computer system for tree-based mining of frequent itemsets that satisfy user-defined constraints from a distributed environment such as a wireless sensor network of uncertain data.

• 出版日期2014-7