Frequent Itemset Mining is a popular data mining task with the aim of discovering frequently co-occurring items and, hence, correlations, hidden in data. Many attempts to apply this family of techniques to Big Data have been presented. Unfortunately, few implementations proved to efficiently scale to huge collections of information. This review presents a comparison of a carefully selected subset of the most efficient and scalable approaches. Focusing on Hadoop and Spark platforms, we consider not only the analysis dimensions typical of the data mining domain, but also criteria to be valued in the Big Data environment.
A review of scalable approaches for frequent itemset mining / Apiletti, Daniele; Garza, Paolo; Pulvirenti, Fabio. - 539:(2015), pp. 243-247. (Intervento presentato al convegno 19th East-European Conference on Advances in Databases and Information Systems, ADBIS 2015 nel 2015) [10.1007/978-3-319-23201-0_27].
A review of scalable approaches for frequent itemset mining
APILETTI, DANIELE;GARZA, PAOLO;PULVIRENTI, FABIO
2015
Abstract
Frequent Itemset Mining is a popular data mining task with the aim of discovering frequently co-occurring items and, hence, correlations, hidden in data. Many attempts to apply this family of techniques to Big Data have been presented. Unfortunately, few implementations proved to efficiently scale to huge collections of information. This review presents a comparison of a carefully selected subset of the most efficient and scalable approaches. Focusing on Hadoop and Spark platforms, we consider not only the analysis dimensions typical of the data mining domain, but also criteria to be valued in the Big Data environment.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2639880
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo