DocumentCode
3306643
Title
Frequent itemset mining on hadoop
Author
Kovacs, F. ; Illes, Janos
Author_Institution
Dept. of Autom. & Appl. Inf., Budapest Univ. of Technol. & Econ. Budapest, Budapest, Hungary
fYear
2013
fDate
8-10 July 2013
Firstpage
241
Lastpage
245
Abstract
One of the most important problems in data mining is frequent itemset mining. It requires very large computation and I/O traffic capacity. For that reason several parallel and distributed mining algorithms were developed. Recently the mapreduce distributed data processing paradigm is unavoidable and porting the current algorithms to mapreduce is in focus. In this paper a substantial frequent itemset mining algorithms and their mapreduce implementations are introduced and investi-gated. An algorithm improvement is also proposed and analyzed.
Keywords
data mining; input-output programs; parallel programming; Hadoop; I/O traffic capacity; data mining; distributed mining algorithms; frequent itemset mining; parallel mining algorithms; Association rules; Clustering algorithms; Conferences; Itemsets; Radiation detectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Cybernetics (ICCC), 2013 IEEE 9th International Conference on
Conference_Location
Tihany
Print_ISBN
978-1-4799-0060-2
Type
conf
DOI
10.1109/ICCCyb.2013.6617596
Filename
6617596
Link To Document