FP-Tree in different implement methods to compare the performances
| Autor: | Shu-Jun Chao, 趙書榮 |
|---|---|
| Rok vydání: | 2002 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 91 now the algorithm in the association rules can be seperated two kinds.first is Apriori-like approach.second is Frequent-Pattern tree.main different between the above is the Frequent-Pattern tree did not to generate the candidate itemsets.its avoid a huge cost to scan database many times. this paper apply three different data structure(FP-tree_tail,FP-tree_hash,FP-tree_hash+tail) to improve Frequent-Pattern tree algorithm .then to compare the performance about them, accroding to the test data we found the performance of the FP-tree alogrithm are worst then the other algorithms many times. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|