快速模組拆解之關聯規則探勘──QMD

QMD Algorithm for Mining Association Rules

近年來，客戶關係管理（CRM）是個相當熱門的議題，因為企業必須了解消費者購物行為與商品間的關聯關係，才能妥善安排商品陳列順序。如此可以提昇客戶滿意度，減少購物的搜尋時間。再者可以刺激購買商品數量，用以增加企業的利潤。所以在大型交易資料庫中，利用資料探勘技術找出有用的關聯法則，來提供企業的決策支援是非常重要的。本研究提出新的演算法QMD（Quick Modulized Decomposition）來找出商品間的關聯法則。QMD演算法的優點如下：只需掃描資料庫一次；2.利用模組化方式來提昇執行效率；3.利用遮罩（mask）與布林模式（Boolean）來產生拆解項目因子模組。上述得知，透過本演算法做關聯分析，其效能將優於以往Apriori-Base的演算法。此外，關聯法則的推導過程中，將不會重複產生多餘的候選項目組，因此更勝於拆解模式的演算法。快速得到正確、有效用的資訊，是企業在數位時代中最大的利器，由此能降低時間成本、快速反映市場需求，是提昇競爭力的最大利基。

Recently Customer Relationship Management is one of the hottest issues in cooperations. In order to properly arrange the positions of products, Cooperations need to understand customers’ shopping behaviors and the associationships between products. In this way, we can increase the customers’ satisfication and decrease the searching time during shopping. Besides, we can increase the quantity of purchase products and the profits. Thus, it is very important to use the technology of data mining to find the useful association rules and to provide the cooperation’s decision supports.In this paper we propose a new algorithm QMD (Quick Modulized Decomposition) to find the association rules from large transaction databases. The merits of QMD algorithm are: 1. In data mining process it only needs to scan whole transaction database once. 2. Using Modulized method to increase the performance of data mining process. 3. Using mask and Boolean method to decompose the itemsets to sub-itemsets. 4. In decompostion process, we combine the same sub-itemsets and get the supports of each sub-itemset very efficiently and significantly shorten the processing time and cost.