Mining association rules with weighted items
Authors:
- A.W.C. FuAFA.W.C. Fu
- C.H. ChengCCC.H. Cheng
- W.W. KwongWKW.W. Kwong
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10988068,p. 68-77
Abstract
Discovery of association rules has been found useful in many applications. In previous work, all items in a basket database are treated uniformly. We generalize this to the case where items are given weights to reflect their importance to the user. The weights may correspond to special promotions on some products, or the profitability of different items. We can mine the weighted association rules with weights. The downward closure property of the support measure in the unweighted case no longer exists and previous algorithms cannot be applied. In this paper, two new algorithms are 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 efficiency of the algorithms for large databases.Keywords
This publication has 4 references indexed in Scilit:
- Efficient mining of association rules in distributed databasesIEEE Transactions on Knowledge and Data Engineering, 1996
- Mining optimized association rules for numeric attributes1996
- Data mining using two-dimensional optimized association rulesACM SIGMOD Record, 1996
- An effective hash-based algorithm for mining association rulesACM SIGMOD Record, 1995