Map Reduce Based FiDoop
| dc.contributor.author | Gagana, Vijayavarshini | |
| dc.contributor.author | Krithika, Rao | |
| dc.date.accessioned | 2017-08-18T09:39:36Z | |
| dc.date.available | 2017-08-18T09:39:36Z | |
| dc.date.issued | 2017-08-18T09:39:36Z | |
| dc.description.abstract | Existing parallel mining algorithms for frequent itemsets lack a mechanism that enables automatic parallelization, load balancing, data distribution, and fault tolerance on large clusters. As a solution to this problem, we design a parallel frequent itemsets mining algorithm called FiDoop using the MapReduce programming model. To achieve compressed storage and avoid building conditional pattern bases, FiDoop incorporates the frequent items ultrametric tree, rather than conventional FP trees. In FiDoop, three MapReduce jobs are implemented to complete the mining task. In the crucial third MapReduce job, the mappers independently decompose itemsets, the reducers perform combination operations by constructing small ultrametric trees, and the actual mining of these trees separately. | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/8507 | |
| dc.language.iso | en | en_US |
| dc.subject | 1NH12IS078 | en_US |
| dc.subject | Map Reduce Based FiDoop | en_US |
| dc.subject | Jyothi Jenifer | en_US |
| dc.subject | ISE Projects 2017 | en_US |
| dc.title | Map Reduce Based FiDoop | en_US |
| dc.type | Other | en_US |