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...
Saved in:
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/1/2.pdf http://umpir.ump.edu.my/id/eprint/6612/ http://www.sersc.org/journals/IJSEIA/vol8_no1_2014/2.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Scalable technique to discover items support from trie data structure
by: Noraziah, Ahmad, et al.
Published: (2012) -
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 Scalable Algorithm for Constructing Frequent Pattern Tree
by: Noraziah, Ahmad, et al.
Published: (2014) -
Mining significant association rules from educational data using critical relative support approach
by: Zailani, Abdullah, et al.
Published: (2011) -
Extracting highly positive association rules from students' enrollment data
by: Zailani, Abdullah, et al.
Published: (2011)