在包裹資料庫中挖掘數量關聯規則

Mining Quantitative Association Rules in Bag Databases

陳彥良(Yen-Liang Chen) ； 許秉瑜(Ping-Yu Hsu) ； 凌俊青(Chun-Ching Ling)

《資訊管理學報》 7卷2期 (2001/01) Pp. 215-229

https://doi.org/10.6382/JIM.200101.0215

摘要

所謂挖掘關聯規則，是要從企業銷售交易資料庫中，找出項目之間的關聯性。過去研究所找出的關聯規則通常只能表達項目間有否相關，卻無法表達它們在不同購買數量時的相關性。如此所產生的問題是，我們將無法知道該以什麼的比例來搭配不同產品一齊販售。因此若關聯規則能加入項目數量資訊的話，將非常有益於制訂行銷策略。本文所提出的演算法，可以找尋出包含項目數量的關聯規則。接著利用指定項目數量的區間及模糊集合原理，找出具有語意的關聯規則。

關鍵字

資料挖掘 ； 關聯規則 ； 模糊集合

並列摘要

The problem of mining association rules is to find the associations between items in a large database of sales transactions. Although there are a lot of previous researches on this area, a common problem occurred is that the rule only indicates if two items are related but as to in what quantities and in what combinations are missing. Without this information it is impossible to design a competitive combination of sales items since we didn't know how many units of items should be included. Therefore, if the quantities of items can be included in association rules, it will be helpful for managers to make the marketing decisions. In this paper, we introduce a new algorithm for mining association rules including the quantities of items. Then, we extend the rules so that the quantities of items can be expressed as user-defined intervals or fuzzy terms.

並列關鍵字

Data mining ； Association rule ； Fuzzy set

參考文獻

Agrawal, R.,Imielinski, T.,Swami, A.(1993).Mining Association Rules between Sets of Items in Large Databases.SIGMOD.

Agrawal, R.,Shafer, J. C.(1996).Parallel Mining of Association Rules: Design, Implementation, and Experience.IEEE Transactions on Knowledge and Data Engineering.8

Agrawal, R.,Srikant, R.(1994).Fast Algorithms for Mining Association Rules.VLDB.

Chen, M. S.,Han, J.,Yu, P. S.(1996).Data Mining: An Overview from a Database Perspective.IEEE Transactions on Knowledge and Data Engineering.8(6)

Cheung, D. W.,Han, J.,Ng, V.,Wong, C. Y.(1996).Proc. 12th IEEE International Conference on Data Engineering (ICDE-96).