Scalable technique to discover items support from trie data structure

Scalable technique to discover items support from trie data structure

One of the popular and compact trie data structure to represent frequent patterns is via frequent pattern tree (FP-Tree). There are two scanning processes involved in the original database before the FP-Tree can be constructed. One of them is to determine the items support (items and their support)...

Full description

Bibliographic Details
Main Authors: Noraziah, Ahmad, Zailani, Abdullah, Herawan, Tutut, Mustafa, Mat Deris
Format: Conference or Workshop Item
Language:English
Published: Springer, Berlin, Heidelberg 2012
Subjects:
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/27033/
http://umpir.ump.edu.my/id/eprint/27033/1/Scalable%20technique%20to%20discover%20items%20support%20from%20trie%20data%20structure.pdf

Internet

http://umpir.ump.edu.my/id/eprint/27033/
http://umpir.ump.edu.my/id/eprint/27033/1/Scalable%20technique%20to%20discover%20items%20support%20from%20trie%20data%20structure.pdf

Similar Items