.png){kind=icon}
Return
Mining constrained frequent itemsets from distributed uncertain data
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2013.10.026.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Data mining
Frequent pattern mining
Advanced data-intensive computing algorithms
Constraints
Distributed computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.9K
Citations:
2.3W
Organization
Cited Papers
ShareSaveEfficiency of Early Selection in Improving Biomass and Predicted Ethanol Yield in Switchgrass.png)
Crop Science
Crop ScienceIF0
PREAI
ShareSaveEffects of Giant Foxtail (Setaria faberi) and Yellow Foxtail (Setaria pumila) Competition on Establishment and Productivity of SwitchgrassWeed Science
Weed ScienceIF0
PREAI
ShareSaveShareSave
View more