Discovery of association rules has been found useful in many applications. In previous work, all items i n a b asket database are t r eated uniformly. We generalize this to the case where items are given weights to re ect their importance to the user. The weights may correspond to special promotions on some products, or the pro tability of di erent items. We can mine the weighted association rules with weights. The downward closure p r operty of the support measure i n the unweighted c ase no longer exist and previous algorithms cannot be applied. In this paper, two new algorithms will be introduced to handle this problem. In these algorithms we make use of a metric called the k-support bound in the mining process. Experimental results show the e ciency of the algorithms for large databases.
However, the use of k-support bound in REF to prune the searching sphere might cost the time.
Mining association rules with weighted items
Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156)
Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156)
Computer Science