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)...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en |
| Published: |
Springer, Berlin, Heidelberg
2012
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/27033/1/Scalable%20technique%20to%20discover%20items%20support%20from%20trie%20data%20structure.pdf http://umpir.ump.edu.my/id/eprint/27033/ https://doi.org/10.1007/978-3-642-34062-8_65 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|