The MapReduce Model on Cascading Platform for Frequent Itemset Mining
The implementation of parallel algorithms is very interesting research recently. Parallelism is very suitable to handle large-scale data processing. MapReduce is one of the parallel and distributed programming models. The implementation of parallel programming faces many difficulties. The Cascading...
Đã lưu trong:
| Những tác giả chính: | , |
|---|---|
| Định dạng: | EJournal Article |
| Được phát hành: |
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.,
2018-07-31.
|
| Những chủ đề: | |
| Truy cập trực tuyến: | Get Fulltext Get Fulltext |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| LEADER | 02164 am a22003013u 4500 | ||
|---|---|---|---|
| 001 | IJCSS_34102 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Rokhman, Nur |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Nursanti, Amelia |e author |
| 245 | 0 | 0 | |a The MapReduce Model on Cascading Platform for Frequent Itemset Mining |
| 260 | |b IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia., |c 2018-07-31. | ||
| 500 | |a https://jurnal.ugm.ac.id/ijccs/article/view/34102 | ||
| 520 | |a The implementation of parallel algorithms is very interesting research recently. Parallelism is very suitable to handle large-scale data processing. MapReduce is one of the parallel and distributed programming models. The implementation of parallel programming faces many difficulties. The Cascading gives easy scheme of Hadoop system which implements MapReduce model.Frequent itemsets are most often appear objects in a dataset. The Frequent Itemset Mining (FIM) requires complex computation. FIM is a complicated problem when implemented on large-scale data. This paper discusses the implementation of MapReduce model on Cascading for FIM. The experiment uses the Amazon dataset product co-purchasing network metadata.The experiment shows the fact that the simple mechanism of Cascading can be used to solve FIM problem. It gives time complexity O(n), more efficient than the nonparallel which has complexity O(n2/m). | ||
| 540 | |a Copyright (c) 2018 IJCCS (Indonesian Journal of Computing and Cybernetics Systems) | ||
| 540 | |a http://creativecommons.org/licenses/by-sa/4.0 | ||
| 546 | |a eng | ||
| 690 | |||
| 690 | |a Frequent Itemset Mining; MapReduce; Cascading | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |2 local | |
| 786 | 0 | |n IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 12, No 2 (2018): July; 149-160 | |
| 786 | 0 | |n 2460-7258 | |
| 786 | 0 | |n 1978-1520 | |
| 787 | 0 | |n https://jurnal.ugm.ac.id/ijccs/article/view/34102/21762 | |
| 856 | 4 | 1 | |u https://jurnal.ugm.ac.id/ijccs/article/view/34102 |z Get Fulltext |
| 856 | 4 | 1 | |u https://jurnal.ugm.ac.id/ijccs/article/view/34102/21762 |z Get Fulltext |