A Scalable Algorithm for Constructing Frequent Pattern Tree
International Journal of Intelligent Information Technologies · 2014
DOI: 10.4018/ijiit.2014010103 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Intelligent Information Technologies, 2014. Verfasst von Zailani Abdullah und 3 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 30 Literaturangaben.
Abstract (Originalsprache)
Frequent Pattern Tree (FP-Tree) is a compact data structure of representing frequent itemsets. The construction of FP-Tree is very important prior to frequent patterns mining. However, there have been too limited efforts specifically focused on constructing FP-Tree data structure beyond from its original database. In typical FP-Tree construction, besides the prior knowledge on support threshold, it also requires two database scans; first to build and sort the frequent patterns and second to build its prefix paths. Thus, twice database scanning is a key and major limitation in completing the construction of FP-Tree. Therefore, this paper suggests scalable Trie Transformation Technique Algorithm (T3A) to convert our predefined tree data structure, Disorder Support Trie Itemset (DOSTrieIT) into FP-Tree. Experiment results through two UCI benchmark datasets show that the proposed T3A generates FP-Tree up to 3 magnitudes faster than that the benchmarked FP-Growth.
Zitieren
APA
Abdullah, Z., Herawan, T., Noraziah, A., & Deris, M. M. (2014). A Scalable Algorithm for Constructing Frequent Pattern Tree. International Journal of Intelligent Information Technologies. https://doi.org/10.4018/ijiit.2014010103
Vancouver
Abdullah Z, Herawan T, Noraziah A, Deris MM. A Scalable Algorithm for Constructing Frequent Pattern Tree. International Journal of Intelligent Information Technologies. 2014. doi:10.4018/ijiit.2014010103
BibTeX
@article{Abdullah2014,
author = {Abdullah, Zailani and Herawan, Tutut and Noraziah, A. and Deris, Mustafa Mat},
title = {A Scalable Algorithm for Constructing Frequent Pattern Tree},
journal = {International Journal of Intelligent Information Technologies},
year = {2014},
doi = {10.4018/ijiit.2014010103}
}
EUVIMED