Research on the comparison between the compressed UF-tree algorithm and the UF-Eclat algorithm based on uncertain data : Chaoquan Chen & Xiujuan Guo Jiahuan Huang

doi:10.1201/9781315226187-267

Chapter

Research on the comparison between the compressed UF-tree algorithm and the UF-Eclat algorithm based on uncertain data

ABSTRACT

Definition 1. The degree of support for uncertain

data items in the dataset is sup( ) ( ),x x Ti i

where k is the number of transactions in a dataset.

Definition 2. If the support for any data item x in the dataset satisfies the minimum support threshold value min Support, x is a frequent term, that is, sup(x)>min Support*k.