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...
Saved in:
Main Authors: | Noraziah, Ahmad, Herawan, Tutut, Zailani, Abdullah, Mustafa, Mat Deris |
---|---|
Format: | Article |
Language: | English |
Published: |
IGI Global
2014
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/6623/1/fskkp-2014-noraziah-Scalable_algorithm.pdf http://umpir.ump.edu.my/id/eprint/6623/ http://dx.doi.org/10.4018/ijiit.2014010103 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
by: Zailani, Abdullah, et al.
Published: (2011) -
DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
by: Zailani, Abdullah, et al.
Published: (2012) -
EFP-M2: Efficient model for mining frequent patterns in transactional database
by: Herawan, Tutut, et al.
Published: (2012) -
Fast Determination of Items Support Technique from Enhanced Tree Data Structure
by: Abdullah, Zailani, et al.
Published: (2014) -
Scalable technique to discover items support from trie data structure
by: Noraziah, Ahmad, et al.
Published: (2012)