Fast Determination of Items Support Technique from Enhanced Tree Data Structure
Frequent Pattern Tree (FP-Tree) is one of the famous data structure to keep frequent itemsets. However when the content of transactional database is modified, FP-Tree must be reconstructed again due to the changes in patterns and items support. Until this recent, most of the techniques in frequent p...
Main Authors: | Abdullah, Zailani, Herawan, Tutut, Noraziah, Ahmad, Mustafa, Mat Deris |
---|---|
Format: | Article |
Language: | English |
Published: |
SERSC
2014
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/6612/ http://umpir.ump.edu.my/id/eprint/6612/ http://umpir.ump.edu.my/id/eprint/6612/ http://umpir.ump.edu.my/id/eprint/6612/1/2.pdf |
Similar Items
-
A Scalable Algorithm for Constructing Frequent Pattern Tree
by: Noraziah, Ahmad, et al.
Published: (2014) -
Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
by: Zailani, Abdullah, et al.
Published: (2011) -
A Model for Visualizing Critical Least Association Rules
by: Noraziah, Ahmad, et al.
Published: (2014) -
Mining Least Association Rules of Degree Level Programs Selected by Students
by: Zailani, Abdullah, et al.
Published: (2014) -
Mining Indirect Least Association Rule from Students' Examination Datasets
by: Zailani, Abdullah, et al.
Published: (2014)