AN EFFICIENT ALGORITHM FOR MINING WEIGHTED ITEMSET TOP-RANK-K

Abstract

In this paper, we propose an efficient algorithm, called WIT-TOP-K, based on the WIT-tree data structure to mine the weighted itemset Top-rank-k in weighted transaction database. The experiment results show that the proposed algorithm performs quickly and accurately with respect to the moderate-sized databases
with a appropriate thresholds.
Key words: Top-rank-k mining, association rules, frequent itemset, frequent patterns, weighted itemsets