A Scalable Algorithm for Constructing Frequent Pattern Tree

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 ori...

Full description

Bibliographic Details
Main Authors:	Noraziah, Ahmad, Herawan, Tutut, Zailani, Abdullah, Mustafa, Mat Deris
Format:	Article
Language:	English
Published:	IGI Global 2014
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://umpir.ump.edu.my/id/eprint/6623/ http://umpir.ump.edu.my/id/eprint/6623/ http://umpir.ump.edu.my/id/eprint/6623/ http://umpir.ump.edu.my/id/eprint/6623/1/fskkp-2014-noraziah-Scalable_algorithm.pdf

id	ump-6623
recordtype	eprints
spelling	ump-66232018-02-02T03:05:41Z http://umpir.ump.edu.my/id/eprint/6623/ A Scalable Algorithm for Constructing Frequent Pattern Tree Noraziah, Ahmad Herawan, Tutut Zailani, Abdullah Mustafa, Mat Deris QA75 Electronic computers. Computer science 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. IGI Global 2014 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/6623/1/fskkp-2014-noraziah-Scalable_algorithm.pdf Noraziah, Ahmad and Herawan, Tutut and Zailani, Abdullah and Mustafa, Mat Deris (2014) A Scalable Algorithm for Constructing Frequent Pattern Tree. International Journal of Intelligent Information Technologies (IJIIT), 10 (1). pp. 42-56. ISSN 1548-3657 (print); 1548-3665 (online) http://dx.doi.org/10.4018/ijiit.2014010103 DOI: 10.4018/ijiit.2014010103
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Noraziah, Ahmad Herawan, Tutut Zailani, Abdullah Mustafa, Mat Deris A Scalable Algorithm for Constructing Frequent Pattern Tree
description	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.
format	Article
author	Noraziah, Ahmad Herawan, Tutut Zailani, Abdullah Mustafa, Mat Deris
author_facet	Noraziah, Ahmad Herawan, Tutut Zailani, Abdullah Mustafa, Mat Deris
author_sort	Noraziah, Ahmad
title	A Scalable Algorithm for Constructing Frequent Pattern Tree
title_short	A Scalable Algorithm for Constructing Frequent Pattern Tree
title_full	A Scalable Algorithm for Constructing Frequent Pattern Tree
title_fullStr	A Scalable Algorithm for Constructing Frequent Pattern Tree
title_full_unstemmed	A Scalable Algorithm for Constructing Frequent Pattern Tree
title_sort	scalable algorithm for constructing frequent pattern tree
publisher	IGI Global
publishDate	2014
url	http://umpir.ump.edu.my/id/eprint/6623/ http://umpir.ump.edu.my/id/eprint/6623/ http://umpir.ump.edu.my/id/eprint/6623/ http://umpir.ump.edu.my/id/eprint/6623/1/fskkp-2014-noraziah-Scalable_algorithm.pdf
first_indexed	2023-09-18T22:02:34Z
last_indexed	2023-09-18T22:02:34Z
_version_	1777414495943000064

A Scalable Algorithm for Constructing Frequent Pattern Tree

Similar Items