Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/476281Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Elankovan Sundararajan, Dr. | |
| dc.contributor.author | Ahamed Lebbe Sayeth Saabith (P68509) | |
| dc.date.accessioned | 2023-10-06T09:15:45Z | - |
| dc.date.available | 2023-10-06T09:15:45Z | - |
| dc.date.issued | 2015-12-01 | |
| dc.identifier.other | ukmvital:80530 | |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/476281 | - |
| dc.description | Apriori algorithm is a classical algorithm of association rule mining and widely used for generating frequent item sets. However, the original Apriori algorithm has many drawbacks such as it needs to scan the dataset many times to discover all frequent itemset and generate huge number of candidate itemset. To overcome these limitations, researchers have made a lot of improvements to the Apriori such as candidate generation, without candidate generation, transaction reduction, partitioning, and sampling. When it comes to mine massive data, these algorithms failed to prove efficiency because limitation of the processing capacity, storage capacity, and main memory constraints. Therefore parallel and distributed algorithms are developed to perform large-scale computing in ARM on multiple processors. However, the problems with most of the parallel and distributed framework are overheads of managing distributed system, lack of high level parallel programming language, and node failures. Hadoop-MapReduce is an efficient, scalable, and simplified programming model for massive data processing and it also available on cloud environment. Cloud computing offers huge computing resources, and capacities to solve big data challenges. Recently many parallel algorithms have been proposed on Hadoop-MapReduce to enhance the performance of Apriori algorithm but there are some drawbacks: since multiple scan over the dataset is needed to generate candidate itemset, it consume more execution time. The aim of this study is to propose a parallel transaction reduction MapReduce Apriori algorithm (TRMR-Apriori) which is reduce unnecessary transaction values and transactions from the dataset in parallel manner to overcome above problems. The experiments show that TRMR-Apriori is able to achieve better execution time to discover frequent itemset those of previous sequential ARM algorithms such as Apriori, AprioriTid, Eclat, and FP-Growth and the previous parallel algorithms such as PApriori, MRApriori, and Modified Apriori with different condition on homogeneous computing environment using Hadoop-MapReduce platform in cloud. Overall, the TRMR-Apriori shows the strength to extract the frequent itemset from massive dataset in cloud.,Master of Information Technology | |
| dc.language.iso | eng | |
| dc.publisher | UKM, Bangi | |
| dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
| dc.rights | UKM | |
| dc.subject | Algorithms | |
| dc.subject | Electronic data processing | |
| dc.subject | Electronic digital computer systems | |
| dc.subject | Dissertations, Academic -- Malaysia | |
| dc.subject | Cloud computing | |
| dc.subject | Universiti Kebangsaan Malaysia -- Dissertations | |
| dc.title | A parellel apriori-transaction reduction algorithm using Hadoop-MapReduce in cloud | |
| dc.type | theses | |
| dc.format.pages | 134 | |
| dc.identifier.callno | QA9.58.S233 2015 3 tesis | |
| dc.identifier.barcode | 002085 (2016) | |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_80530+SOURCE1+SOURCE1.0.PDF Restricted Access | 125.25 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.