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 |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1007/978-3-642-34062-8_65 http://dx.doi.org/10.1007/978-3-642-34062-8_65 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|