arrow
返回

A Parallel MapReduce Algorithm to Efficiently Support Itemset Mining on High Dimensional Data

delete2017-12-01
delete16
delete
OA
AI
D
Daniele Apiletti
E
Elena Baralis
T
Tania Cerquitelli
P
Paolo Garza
F
Fabio Pulvirenti *
P
Pietro Michiardi
DOI:10.1016/j.bdr.2017.10.004delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In today's world, large volumes of data are being continuously generated by many scientific applications, such as bioinformatics or networking. Since each monitored event is usually characterized by a variety of features, high-dimensional datasets have been continuously generated. To extract value from these complex collections of data, different exploratory data mining algorithms can be used to discover hidden and non-trivial correlations among data. Frequent closed itemset mining is an effective but computational expensive technique that is usually used to support data exploration. Thanks to the spread of distributed and parallel frameworks, the development of scalable approaches able to deal with the so called Big Data has been extended to frequent itemset mining. Unfortunately, most of the current algorithms are designed to cope with low-dimensional datasets, delivering poor performances in those use cases characterized by high-dimensional data. This work introduces PaMPa-HD, a MapReduce-based frequent closed itemset mining algorithm for high dimensional datasets. An efficient solution has been proposed to parallelize and speed up the mining process. Furthermore, different strategies have been proposed to easily configure the algorithm parameter. The experimental results, performed on real-life high-dimensional use cases, show the efficiency of the proposed approach in terms of execution time, load balancing and robustness to memory issues. (C) 2017 Elsevier Inc. All rights reserved.
Keyword:
High-dimensional data
Frequent closed itemset mining
Hadoop framework
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Big Data Research 封面图
Big Data Research
IF:
4.2
论文数:
419
被引数:
1.1K

机构

P
Polytechnic University of Turin
学者数:
1.3W
论文数: 1.3W
被引数: 1.3W
I
imt - institut mines-telecom
学者数:
7.4K
论文数: 6.4K
被引数: 5
引用论文

引用论文

Formal potentials and cyclic voltammetry of some ruthenium-ammine complexes
err2002-05-01
err0
PREAI
errHong Sup Lim; Donald J. Barclay; Fred C. Anson
err分享
err收藏
Camptothecin exhibits topoisomerase1-independent KMT1A suppression and myogenic differentiation in alveolar rhabdomyosarcoma cells
err2018-05-25
err0
errOAAI
errDavid W. Wolff; Min-Hyung Lee; Mathivanan Jothi; Munmun Mal; Fengzhi Li; Asoke K. Mal
err分享
err收藏
Fast wrapper feature subset selection in high-dimensional datasets by means of filter re-ranking
err2012-02-01
err123
PREAI
errBermejo, Pablo; de la Ossa, Luis; Gamez, Jose A.; Puerta, Jose M.
err分享
err收藏
err分享
err收藏
Experiences of Internet Traffic Monitoring with Tstat
err2011-05-01
err123
errOAAI
errFinamore, Alessandro; Mellia, Marco; Meo, Michela; Munafo, Maurizio M.; Rossi, Dario
err分享
err收藏
Elementorganische Amin/Imin‐Verbindungen, XXIII. Aminophosphan‐ und Aminophosphoran‐Rotamere
err2006-01-23
err0
PREAI
errOtto J. Scherer; Michael Püttmann; Carl Krüger; Gotthelf Wolmershäuser
err分享
err收藏
Association rule mining to detect factors which contribute to heart disease in males and females
err2013-03-01
err220
PREAI
errNahar, Jesmin; Imam, Tasadduq; Tickle, Kevin S.; Chen, Yi-Ping Phoebe
err分享
err收藏
学者 查看更多内容