臺灣博碩士論文加值系統

探勘關聯規則(Association Rules)可以找出顧客買了哪些商品也會一起購買哪些其它的商品。探勘高效益項目集(Mining Utility Itemset)可以找出能為公司帶來較高獲利的商品組合。然而高效益項目集只能告訴商家哪些商品組合能夠帶來高獲利，而無法知道客戶買了某些商品的同時也應該推薦給他哪些其他的商品才能將獲利再提升。因此，本研究提出了效益關聯規則(Utility Association Rules)的定義並提出探勘效益關聯規則的演算法，找出在購買某些商品的前提下，再購買其他哪些商品會提升原有的效益。藉由效益關聯規則，公司可以清楚地了解顧客購買了哪些商品之後應該要推薦給顧客一起購買什麼商品，能夠讓公司獲得更大的利益。

Mining Association Rules can find which products would be purchased by the customer when a customer has bought some products, and we can use association rules to recommend products for customers. Mining High Utility Itemset is to find the combinations of products which could bring high profit to us. However, High Utility Itemset only tells us which products bring high profit but not increase profit when we recommend other product to customer. Therefore, we propose definitions and algorithm of Mining Utility Association Rules to find which product to recommend and to bring us more benefit than the original high utility itemsets. We will clearly know which product should be recommended to customer bring more profit to us with Utility Association Rules.

摘要 .......................................... i
ABSTRACT ..................................... ii
致謝 ........................................ iii
目錄 ......................................... iv
圖目錄 ........................................ v
表目錄 ....................................... vi
第一章 簡介 ................................... 1
第二章 研究背景 ............................... 4
2.1 探勘頻繁項目集 ............................ 4
2.1.1 Apriori 演算法 .......................... 4
2.1.2 FP-Growth 演算法 ........................ 4
2.2 探勘高效益項目集 .......................... 5
2.2.1 Two-Phase 演算法 ........................ 6
2.2.2 UP-Growth 演算法 ........................ 7
2.2.3 吸附式探勘演算法(Adsorptive Mining) ..... 8
第三章 研究方法 .............................. 10
第四章 實驗結果 .............................. 25
4.1 實驗資料集 ............................... 25
4.2 人造資料集的實驗結果 ..................... 25
4.3 FoodMart 的實驗結果 ...................... 29
第五章 結論及未來工作 ........................ 31
參考文獻 ..................................... 32

[1]R. Agrawal and R. Srikant, “Fast algorithms for mining association rules”, In Proceedings of the 20th Very Large Data Bases Conference(VLDB), 1994, pp. 487-499
[2]R. Agrawal and R. Srikant. “Mining Quantitative Association Rules in Large Relational Tables”, Proc. ACM SIGMOD, 1996, pp. 1-12
[3]Z.H. Deng, Z.H. Wang, and J.J. Jiang, "A new algorithm for fast mining frequent itemsets using N-lists." Science China Information Sciences Vol. 55 Issue 9, 2012, pp. 2008-2030.
[4]A. Erwin, R.P. Gopalan, N.R. Achuthan, “CTU: An Efficient Hugh Utility Itemset Mining Algorithm Using the Pattern Growth Approach”, Computer and Information Technology, 2007. CIT 2007. 7th IEEE International Conference on. IEEE, 2007, pp. 71-76
[5]A. Erwin, R.P. Gopalan, and N.R. Achuthan, “Efficient mining of high utility itemsets from large datasets.” Advances in Knowledge Discovery and Data Mining. Springer Berlin Heidelberg, 2008, pp. 554-561.
[6]J. Han, R. Mao, J. Pei and Y. Yin, “Mining frequent patterns without candidate generation: a frequent-pattern tree approach”, Data Mining and Knowledge Discovery, 2004, pp. 53-87
[7]A.B.M.R. Islam and T.S. Chung, “An Improved Frequent Pattern Tree Based Association Rule Mining Technique”, Int. Conf. on Information Science and Applications, 2011, pp. 1-8
[8]Y. Liu, W. Liao, and A. Choudhary, “A Fast High Utility Itemsets Mining Algorithm”, Proceedings of the ACM Intel. Conference on Utility-Based Data Mining Workshop(UMDB), 2005, pp. 90-99
[9]E. Mohammad and R.Z. Osmar, “COFI approach for mining frequent itemsets revisited”, DMKD 2004 Pro. of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, 2004, pp. 70-75
[10]V.S. Tseng, C.W. Wu, B.E. Shie, and P.S. Yu, "UP-Growth: An Efficient Algorithm for High Utility Itemset Mining" Proceedings of the 16th ACM SIGKDD International Conference on Knowledge discovery and data mining. ACM, 2010, pp. 253-262
[11]C.W. Wu, B.E. Shie, V.S. Tseng, P.S. Yu, “Mining Top-K High Utility Itemsets”, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, 2012, pp. 78-86
[12]S.J. Yen, C.C. Chen, Y.S. Lee, “A Fast Algorithm for Mining High Utility Itemsets” Conference on Technologies and Applications of Artificial Intelligence, 2010, pp. 1459-1464
[13]S.J. Yen, C.K. Wang and L.Y. Ouyang “A Search Space Algorithm for Mining Frequent Patterns”, Journal of Information Science and Engineering (JISE): Special issue on Technologies and Applications of Artificial Intelligence, Vol.28, No. 1, 2012, pp. 177-191