Budiono, Marshel Nathanael Irawan (2013) SIMULATION FP-GROWTH ALGORITHM AND HASH BASED ALGORITHM. Other thesis, Unika Soegijapranata Semarang.
|
Text (COVER)
10.02.0038 Marshel Nathanael Irawan B - COVER.pdf Download (335kB) | Preview |
|
|
Text (CHAPTER 1)
10.02.0038 Marshel Nathanael Irawan B - CHAPTER 1.pdf Download (62kB) | Preview |
|
![[img]](https://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (CHAPTER 2)
10.02.0038 Marshel Nathanael Irawan B - CHAPTER 2.pdf Restricted to Registered users only Download (239kB) |
|
|
Text (CHAPTER 3)
10.02.0038 Marshel Nathanael Irawan B - CHAPTER 3.pdf Download (35kB) | Preview |
|
|
Text (CHAPTER 4)
10.02.0038 Marshel Nathanael Irawan B - CHAPTER 4.pdf Download (415kB) | Preview |
|
|
Text (CHAPTER 5)
10.02.0038 Marshel Nathanael Irawan B - CHAPTER 5.pdf Download (1MB) | Preview |
|
|
Text (CHAPTER 6)
10.02.0038 Marshel Nathanael Irawan B - CHAPTER 6.pdf Download (24kB) | Preview |
|
|
Text (REFERENCES)
10.02.0038 Marshel Nathanael Irawan B - REFERENCES.pdf Download (14kB) | Preview |
Abstract
FP-Growth Algorithm and Hash Based Algorithm is subgroup from Association Rule Algorithm, where the function is for determine the data association or Iternset which often appear concurrently in the data collection.The difierent between FP-Growth Algorithm and Hash Based Algorithm is the process of algorithm completion, where FP-Growth Algorithm use Tree and Hash Based Algorithm use Hash Table. FP-Growth Algorithm in aplication contains 2 Iteration, where in First Iteration select items that have frequent more than min support value. And next step is order items in transaction. Then show FP-Tree Simulation, after that FPGrowth Algorithm began selecting items that frquentIy appear together with the use of FP-Tree. And from the process can get the result. Hash Based Algorithm contains 3 iteration, where in first Iteration select items that have frequent more than min support value. Second Iteration is input Itemset 2 Item to the Hash Table based on Hash Bucket Formula and selection Itemset 2 Item that have frequent more tIlan min support value. TIle third Iteration is show Itemset 3 Item tIlat have frequent more than min support value. This application aims to help users in the process of completion of the FPGrowth Algorithm and Hash Based Algorithm, both in time optimization and process optimization. other than that this application can help the user in learning FP-Growth Algorithm and Hash Based Algorithm, because in this application there is also explanation of the steps of the program
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Mrs Christiana Sundari |
| Date Deposited: | 23 Oct 2018 07:14 |
| Last Modified: | 23 Oct 2018 07:14 |
| URI: | http://repository.unika.ac.id/id/eprint/17106 |
Actions (login required)
 |
View Item |
