Mining constrained frequent itemsets from distributed uncertain data

被引:54
作者
Cuzzocrea, Alfredo [1 ,2 ]
Leung, Carson Kai-Sang [3 ]
MacKinnon, Richard Kyle [3 ]
机构
[1] ICAR CNR, I-87036 Arcavacata Di Rende, CS, Italy
[2] Univ Calabria, I-87036 Arcavacata Di Rende, CS, Italy
[3] Univ Manitoba, Dept Comp Sci, Winnipeg, MB R3T 2N2, Canada
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2014年 / 37卷
基金
加拿大自然科学与工程研究理事会;
关键词
Data mining; Frequent pattern mining; Advanced data-intensive computing algorithms; Constraints; Distributed computing; PARALLEL;
D O I
10.1016/j.future.2013.10.026
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:117 / 126
页数:10
相关论文
共 38 条
[1]  
Aggarwal CC, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P29
[2]   Parallel mining of association rules [J].
Agrawal, R ;
Shafer, JC .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (06) :962-969
[3]  
Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072
[4]  
Agrawal R., P 20 INT C VERY LARG
[5]  
Bernecker T, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P119
[6]   Storing and retrieving XPath fragments in structured P2P networks [J].
Bonifati, Angela ;
Cuzzocrea, Alfredo .
DATA & KNOWLEDGE ENGINEERING, 2006, 59 (02) :247-269
[7]  
Cameron J J., 2013, Web-age information management, P51
[8]   ProFID: Practical frequent items discovery in peer-to-peer networks [J].
Cem, Emrah ;
Ozkasap, Oznur .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2013, 29 (06) :1544-1560
[9]  
Cheung DW, 1996, PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED INFORMATION SYSTEMS, P31, DOI 10.1109/PDIS.1996.568665
[10]  
Chui CK, 2007, LECT NOTES COMPUT SC, V4426, P47