Current Proceedings on Technology

Yazarlar: Zailani Abdullah, Tutut Herawan, A. Noraziah, Mustafa Mat Deris

Konular:-

Anahtar Kelimeler:Tree data structure,Incremental,Algorithm,Fast

Özet: A compact data structure to keep large transactions is very important. One of the alternatives is to use tree data structure. However, not all of them can effort to handle the incremental online transactions and still limited to offline processes such as to build frequent pattern tree (FP-Tree). The main drawback of typical FP-Tree is it must rely on the offline databases. Therefore, this paper suggested Fast Online Trie Algorithm (FOLTA) to build our predefined incremental tree data structure, Disorder Support Trie Itemset (DOSTrieIT). Experiments with the UCI datasets show that the FOLTA can replace the dependency of offline database, up to 2 times faster than the benchmarked CanTree algorithm.

---