… benchmark creates many lists and adds thousands of data structures to them, for the sole
pur… In this paper, we focus on these low-utility data structures. A data structure has low utility if …

… {F}, {G} and {H} are the low utility items as their TWU is below … a novel data structure, UPHist
tree for finding high utility … hence helped in pruning the search space better. Experimental …

… then X with all its supersets can be prnned since they are low-utility itemsets [2]. Utility-list and
… not changed, but the search method based on the novel data structure has been changed. …

… the cost of patterns, it can find numerous patterns that have a … the extraction of a graph
structure representing a process, which … -off, they often also have a low utility. Thus, on overall we …

… , we can use the previous data structures and mining results, … the second database scan to
find high utility itemsets from high … Thus, we can say that “ce” is a low-utility itemset for ¼ 30% …

… {F}, {G} and {H} are the low utility … data structure, UP-Hist tree for finding high utility itemsets.
The inclusion of histogram reduced the estimated utility and helped in pruning the search …

… tree-based summary data structure are developed to improve … It is a low utility itemset but
its superset 2-itemset (bd) is a … From this figure, we can find that the relation of execution time …

… , shapes, and/or data values rather than reconstructing them. This … programmers find allocation
sites that create such data structures … Finding low-utility data structures. In ACM SIGPLAN …

… search space. Taking these theoretical results as a foundation, a new CUL (Cost-Utility List)
data structure … by identifying sequences that have a low utility early during the pattern mining …

… to find a set of high-utility patterns from large databases. However, a utility itemset may consist
of some low-utility items. … data structure in window initialization phase, updating time of the …