uds-tree
2016-08-23
2 0 0
no vote
Other
Earn points
we propose an efficient algorithm named UDS-FIM and a tree structure named UDS-Tree. Firstly, UDS-FIM compresses transaction itemsets to a UDS-Tree as compact as the original FP-Tree; secondly, it mines frequent itemsets from the UDS-Tree without additional scan of transactions. We evaluate our algorithm using sparse and dense datasets including real-world datasets and synthetic datasets; the final experimental results show that UDS-FIM has achieved a good performance under different experimental conditions, especially on real-world datasets.
Related Source Codes
Android AOA Android Open Accessory Development Usi
0
0
no vote
Golang AOA Android Open Accessory HID Control
0
0
no vote
PClite
0
0
no vote
GMSK Linear Receiver
0
0
no vote
The golden version of AFT that has been passed dow
0
0
no vote
No comment