§ 瀏覽學位論文書目資料
  
系統識別號 U0002-1707201813274200
DOI 10.6846/TKU.2018.00481
論文名稱(中文) eDM促銷機制在超市的應用
論文名稱(英文) eDM Promotion Mechanisms and Their Applications in Supermarket
第三語言論文名稱
校院名稱 淡江大學
系所名稱(中文) 資訊工程學系博士班
系所名稱(英文) Department of Computer Science and Information Engineering
外國學位學校名稱
外國學位學院名稱
外國學位研究所名稱
學年度 106
學期 2
出版年 107
研究生(中文) 吳騰芳
研究生(英文) Terng-Fang Wu
學號 802410034
學位類別 博士
語言別 繁體中文
第二語言別
口試日期 2018-06-25
論文頁數 110頁
口試委員 指導教授 - 蔣璿東
委員 - 王鄭慈
委員 - 王亦凡
委員 - 葛煥昭
委員 - 許輝煌
關鍵字(中) 推薦系統
協同過濾
概念漂移
關鍵字(英) Recommendation System
Collaboration Filtering
Concept Drift
第三語言關鍵字
學科別分類
中文摘要
在本研究中,為了幫助行銷人員選擇eDM發送的目標客戶,我們利用概念漂移建構的會員回購力指數,以預測實體超市會員的回購力並選取高回購力的目標客戶。根據會員預測的高回購力,行銷人員可以為不同類型的超市會員設計適當的促銷方案,以提高促銷效率。
由於我們的研究的對象是台灣某知名超市,而超市主要的販售商品以食品居多,食品屬於消耗品,導致顧客下次消費時仍然會重複購買相同的商品。另外,由於顧客在選擇自己喜歡的產品之前只會花些許的時間來閱讀eDM,造成eDM的商品數量只能包含一小部分的固定商品。因此在本研究中,我們將考量以上的特性提出一個新的商品組合推薦計算方式,針對不同會員設計不同商品組合的eDM。同時,在本研究中,我們使用這家超市的顧客交易記錄作為測試數據。這家超市的行銷部門審查了所有的實驗結果,並證實我們的方法不僅超越了超市採用的現有方法,而且還有助於超市顧客的選定及設計合適的eDM促銷策略。
   未來,可依概念漂移選取不同回購力的顧客,並且亦將產品結合價格,讓行銷人員設計最佳的促銷策略,以提高超市營收。並可結合分析顧客線上消費行為、線上瀏覽行為與商品購買週期,對顧客進行線上線下資料整合分析,以祈未來能在適當的時間,選取適當的人選,推薦適當的商品,將能大大提升顧客來店消費之意願,吸引顧客回到門市進行消費。
英文摘要
In this study, To help marketers choose the target customers for eDM, we target customers with high repurchase power. Therefore, We use the customer repurchase index with concept drift to predict members’ repurchase rates for a physical supermarket’s members and select target customers with high repurchase power. Based on members’ predicted repurchase rates, marketers can design proper marketing strategies for different types of supermarket member to improve marketing effectiveness. 
Becasuse our research target is a well-known Taiwanese supermarket, suprtmarket mainly sell food, and the food is consumable. Customers will still purchase the same commodity repeatedly when next time back to store. In addition, because customers can only spend a short amount of time reading eDM before choosing the commodity that they like, In this study, a new recommendation system for the most suitable combination of cmmodity under the above condition that a customized eDM can include only a small, fixed number of such types. In this study, customer transaction records from a well-known Taiwanese supermarket were used as the test data. This supermarket’s marketing department reviewed all the experimental results and confirmed that our approach is not only superior to the current approach employed by the supermarket but also useful in designing appropriate eDM marketing strategies for selected supermarket customers.
In the future, customers with different repurchase powers can be selected according to the concept drift, and the commodities are combined with the price, so that the marketing staff can design the best promotion strategy to increase revenue. It can also analyze the online consumer behavior, online browsing behavior and commodity purchase cycle to recommend appropriate commodities at the right time to selected target customers for attracting target customers back to the store for consumption.
第三語言摘要
論文目次
目錄
第1章  緒論	1
1.1  研究動機與目的	1
1.2  研究架構	4
第2章  相關文獻與研究探討	5
2.1  以內容為基礎的推薦系統	5
2.2  協同過濾推薦系統	7
2.3  混合式推薦系統	15
2.4    顧客輪廓	17
2.5    概念飄移	19
第3章  研究流程	26
3.1	問題陳述	26
3.2  研究方法	27
3.2.1	高回購力顧客之選取	28
3.2.2	商品組合推薦之設計	32
第4章  商品類別推薦實驗結果與探討	41
4.1  針對高回購力前500名顧客進行推薦	42
4.1.1  使用COS、BIG和CBF演算法	42
4.1.2  使用CBF組合演算法	45
4.2  針對高回購力前1000名顧客進行推薦	48
4.2.1  使用COS、BIG和CBF演算法	48
4.2.2  使用CBF組合演算法	50
4.3  針對高回購力前1500名顧客進行推薦	52
4.3.1  使用COS、BIG和CBF演算法	52
4.3.2  使用CBF組合演算法	54
4.4  針對高回購力前2000名顧客進行推薦	56
4.4.1  使用COS、BIG和CBF演算法	56
4.4.2  使用CBF組合演算法	58
第5章  商品推薦實驗結果與探討	61
5.1  針對高回購力前500名顧客進行推薦	61
5.1.1  使用COS、BIG和CBF演算法	61
5.1.2  使用CBF組合演算法	64
5.2  針對高回購力前1000名顧客進行推薦	67
5.2.1  使用COS、BIG和CBF演算法	67
5.2.2  使用CBF組合演算法	69
5.3  針對高回購力前1500名顧客進行推薦	71
5.3.1  使用COS、BIG和CBF演算法	71
5.3.2  使用CBF組合演算法	73
5.4  針對高回購力前2000名顧客進行推薦	75
5.4.1  使用COS、BIG和CBF演算法	75
5.4.2  使用CBF組合演算法	77
第6章  結論與未來研究方向	79
參考文獻	81
附錄-英文論文	86

圖目錄
圖 1  顧客對於商品的評價分數矩陣	10
圖 2  Cos User-based計算範例	12
圖 3  Cos Item-based計算範例	13
圖 4  3種不同的參數所呈現的時間函數曲線	22
圖 5  Algorithm of The CPIT Model	25
圖 6  6月的預測回購率與實際回購率比較	30
圖 7  6月的實際平均消費金額	31
圖 8  RIT6與RI6在7月實際回購率之比較	32
圖 9  CBF Algorithm	37
圖 10  5個商品類別或商品的推薦成功率圖	38
圖 11  5個商品類別或商品的新商品類別或商品推薦成功率圖	39
圖 12  5個商品類別或商品的重複購買相同商品類別或商品推薦成功率圖	40
圖 13  前500名客戶4個商品類別的推薦成功率	43
圖 14  前500名客戶5個商品類別的推薦成功率圖	44
圖 15  前500名客戶6個商品類別的推薦成功率圖	44
圖 16  前500名客戶4個商品類別組合的推薦成功率圖	46
圖 17  前500名客戶5個商品類別組合的推薦成功率	47
圖 18  前500名客戶6個商品類別組合的推薦成功率圖	47
圖 19  前1000名客戶4個商品類別的推薦成功率圖	49
圖 20  前1000名客戶5個商品類別的推薦成功率圖	49
圖 21  前1000名客戶6個商品類別的推薦成功率圖	50
圖 22  前1000名客戶4個商品類別組合的推薦成功率圖	51
圖 23  前1000名客戶5個商品類別組合的推薦成功率圖	51
圖 24  前1000名客戶6個商品類別組合的推薦成功率圖	52
圖 25  前1500名客戶4個商品類別的推薦成功率圖	53
圖 26  前1500名客戶5個商品類別的推薦成功率	53
圖 27  前1500名客戶6個商品類別的推薦成功率圖	54
圖 28  前1500名客戶4個商品類別組合的推薦成功率圖	55
圖 29  前1500名客戶5個商品類別組合的推薦成功率圖	55
圖 30  前1500名客戶6個商品類別組合的推薦成功率圖	56
圖 31  前2000名客戶4個商品類別的推薦成功率圖	57
圖 32  前2000名客戶5個商品類別的推薦成功率圖	57
圖 33  前2000名客戶6個商品類別的推薦成功率圖	58
圖 34  前2000名客戶4個商品類別組合的推薦成功率圖	59
圖 35  前2000名客戶5個商品類別組合的推薦成功率圖	59
圖 36  前2000名客戶6個商品類別組合的推薦成功率圖	60
圖 37  前500名客戶4個商品的推薦成功率圖	62
圖 38  前500名客戶5個商品的推薦成功率圖	63
圖 39  前500名客戶6個商品的推薦成功率圖	63
圖 40  前500名客戶4個商品組合的推薦成功率圖	65
圖 41  前500名客戶5個商品組合的推薦成功率圖	65
圖 42  前500名客戶6個商品組合的推薦成功率圖	66
圖 43  前1000名客戶4個商品的推薦成功率圖	67
圖 44  前1000名客戶推薦5個商品的推薦成功率圖	68
圖 45  前1000名客戶6個商品的推薦成功率圖	68
圖 46  前1000名客戶4個商品組合的推薦成功率圖	69
圖 47  前1000名客戶5個商品組合的推薦成功率圖	70
圖 48  前1000名客戶6個商品組合的推薦成功率圖	70
圖 49  前1500名客戶4個商品的推薦成功率圖	71
圖 50  前1500名客戶5個商品的推薦成功率圖	72
圖 51  前1500名客戶6個商品的推薦成功率圖	72
圖 52  前1500名客戶4個商品組合的推薦成功率圖	73
圖 53  前1500名客戶5個商品組合的推薦成功率圖	74
圖 54  前1500名客戶6個商品組合的推薦成功率圖	74
圖 55  前2000名客戶4個商品的推薦成功率圖	75
圖 56  前2000名客戶5個商品的推薦成功率圖	76
圖 57  前2000名客戶6個商品的推薦成功率圖	76
圖 58  前2000名客戶4個商品組合的推薦成功率圖	77
圖 59  前2000名客戶5個商品組合的推薦成功率圖	78
圖 60  前2000名客戶6個商品組合的推薦成功率圖	78

表目錄
表 1  以內容為基礎的推薦系統的主要問題表	7
參考文獻
[1]張淑俐, "超市賣場推薦系統實作," PhD Unpublished Thesis, 淡江大學, 2013.
[2]紀政宏, "推薦系統的架構與實作," PhD Unpublished Thesis, 淡江大學, 2011.
[3]M. Pazzani and D. Billsus, "Content-based recommendation systems," The adaptive web, pp. 325-341, 2007.
[4]N. J. Belkin and W. B. Croft, "Information filtering and information retrieval: two sides of the same coin?," Commun. ACM, vol. 35, pp. 29-38, 1992.
[5]R. Baeza-Yates and B. Ribeiro-Neto, "Modern information retrieval vol. 463: ACM press New York.," 1999.
[6]G. Salton, Automatic text processing: the transformation, analysis, and retrieval of information by computer: Addison-Wesley Longman Publishing Co., Inc., 1989.
[7]M. F. Porter, "An algorithm for suffix stripping," Program: electronic library and information systems, vol. 14, pp. 130-137, 1993.
[8]J. J. Rocchio, "Relevance feedback in information retrieval," 1971.
[9]P. W. Foltz and S. T. Dumais, "Personalized information delivery: An analysis of information filtering methods," Communications of the ACM, vol. 35, pp. 50-60, 1992.
[10]S. Loeb, "Architecting personalized delivery of multimedia information," Communications of the ACM, vol. 35, pp. 39-47, 1992.
[11]M. d. Gemmis, P. Lops, G. Semeraro, and P. Basile, "Integrating tags in a semantic content-based recommender," presented at the Proceedings of the 2008 ACM conference on Recommender systems, Lausanne, Switzerland, 2008.
[12]V. Zanardi and L. Capra, "Social ranking: uncovering relevant content using tag-based recommender systems," presented at the Proceedings of the 2008 ACM conference on Recommender systems, Lausanne, Switzerland, 2008.
[13]CiteULike. Available: http://www.citeulike.org/home
[14]X. N. Lam, T. Vu, T. D. Le, and A. D. Duong, "Addressing cold-start problem in recommendation systems," presented at the Proceedings of the 2nd international conference on Ubiquitous information management and communication, Suwon, Korea, 2008.
[15]A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock, "Methods and metrics for cold-start recommendations," presented at the Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, Tampere, Finland, 2002.
[16]C. Wartena, W. Slakhorst, and M. Wibbels, "Selecting keywords for content based recommendation," presented at the Proceedings of the 19th ACM international conference on Information and knowledge management, Toronto, ON, Canada, 2010.
[17]G. Adomavicius and A. Tuzhilin, "Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions," IEEE Trans. on Knowl. and Data Eng., vol. 17, pp. 734-749, 2005.
[18]U. Shardanand and P. Maes, "Social information filtering: algorithms for automating “word of mouth&rdquo," presented at the Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Denver, Colorado, USA, 1995.
[19]D. Billsus and M. J. Pazzani, "User Modeling for Adaptive News Access," User Modeling and User-Adapted Interaction, vol. 10, pp. 147-180, 2000.
[20]E. Rich, "User modeling via stereotypes," in Readings in intelligent user interfaces, T. M. Mark and W. Wolfgang, Eds., ed: Morgan Kaufmann Publishers Inc., 1979, pp. 329-342.
[21]D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, "Using collaborative filtering to weave an information tapestry," Commun. ACM, vol. 35, pp. 61-70, 1992.
[22]U. Shardanand and P. Maes, "Social information filtering: algorithms for automating "word of mouth"," presented at the Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Denver, Colorado, USA, 1995.
[23]J. A. Konstan, B. N. Miller, D. Maltz, J. L. Herlocker, L. R. Gordon, and J. Riedl, "GroupLens: applying collaborative filtering to Usenet news," Commun. ACM, vol. 40, pp. 77-87, 1997.
[24]L. Terveen and W. Hill, "Beyond Recommender Systems: Helping People Help Each Other," ed, 2001.
[25]G. Linden, B. Smith, and J. York, "Amazon.com recommendations: item-to-item collaborative filtering," Internet Computing, IEEE, vol. 7, pp. 76-80, 2003.
[26]R. M. Bell and Y. Koren, "Lessons from the Netflix prize challenge," SIGKDD Explor. Newsl., vol. 9, pp. 75-79, 2007.
[27]B. Pradel, S. Sean, J. Delporte, S. Guérif, C. Rouveirol, F. Fogelman-Soulié, et al., "A case study in a recommender system based on purchase data," presented at the Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, San Diego, California, USA, 2011.
[28]J. Wang, B. Sarwar, and N. Sundaresan, "Utilizing related products for post-purchase recommendation in e-commerce," presented at the Proceedings of the fifth ACM conference on Recommender systems, Chicago, Illinois, USA, 2011.
[29]J. B. Schafer, J. Konstan, and J. Riedl, "Recommender systems in e-commerce," presented at the Proceedings of the 1st ACM conference on Electronic commerce, Denver, Colorado, USA, 1999.
[30]M. Deshpande and G. Karypis, "Item-based top-N recommendation algorithms," ACM Trans. Inf. Syst., vol. 22, pp. 143-177, 2004.
[31]B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, "Item-based collaborative filtering recommendation algorithms," presented at the Proceedings of the 10th international conference on World Wide Web, Hong Kong, Hong Kong, 2001.
[32]L. Candillier, F. Meyer, and M. Boull, "Comparing State-of-the-Art Collaborative Filtering Systems," presented at the Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition, Leipzig, Germany, 2007.
[33]X. Su and T. M. Khoshgoftaar, "A survey of collaborative filtering techniques," Adv. in Artif. Intell., vol. 2009, pp. 2-2, 2009.
[34]C. G. González, J. W. Bonventi, and A. L. Rodrigues, "Density of Closed Balls in Real-Valued and Autometrized Boolean Spaces for Clustering Applications," presented at the Proceedings of the 19th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence, Savador, Brazil, 2008.
[35]D. Lemire and A. Maclachlan, "Slope One Predictors for Online Rating-Based Collaborative Filtering," in Proceedings of the 2005 SIAM International Conference on Data Mining, ed, 2005, pp. 471-475.
[36]H. C. Kum, J. H. CHANG, and W. WANG, "Sequential pattern mining in multi-databases via multiple alignment," Data Mining and Knowledge Discovery, vol. 12, pp. 151-180, 2006.
[37]D. Billsus and M. J. Pazzani, "Learning Collaborative Information Filters," presented at the Proceedings of the Fifteenth International Conference on Machine Learning, 1998.
[38]T. K. Landauer and M. L. Littman, "Computerized cross-language document retrieval using latent semantic indexing," ed: Google Patents, 1994.
[39]S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman, "Indexing by latent semantic analysis," JASIS, vol. 41, pp. 391-407, 1990.
[40]P. Resnick and H. R. Varian, "Recommender systems," Communications of the ACM, vol. 40, pp. 56-58, 1997.
[41]K. Pearson, "LIII. On lines and planes of closest fit to systems of points in space," The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, vol. 2, pp. 559-572, 1901.
[42]M. Zanker, "A collaborative constraint-based meta-level recommender," in Proceedings of the 2008 ACM conference on Recommender systems, 2008, pp. 139-146.
[43]A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock, "Methods and metrics for cold-start recommendations," in Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, 2002, pp. 253-260.
[44]Q. Li and B. M. Kim, "Clustering approach for hybrid recommender system," in Web Intelligence, 2003. WI 2003. Proceedings. IEEE/WIC International Conference on, 2003, pp. 33-38.
[45]R. Burke, "Hybrid web recommender systems," in The adaptive web, ed: Springer, 2007, pp. 377-408.
[46]A. Gunawardana and C. Meek, "A unified approach to building hybrid recommender systems," in Proceedings of the third ACM conference on Recommender systems, 2009, pp. 117-124.
[47]G. Lekakos and P. Caravelas, "A hybrid approach for movie recommendation," Multimedia tools and applications, vol. 36, pp. 55-70, 2008.
[48]MovieLens. Available: http://www.movielens.org
[49]Y.-H. Lee, T.-H. Cheng, C.-W. Lan, C.-P. Wei, and P. J.-H. Hu, "Overcoming small-size training set problem in content-based recommendation: a collaboration-based training set expansion approach," in Proceedings of the 11th International Conference on Electronic Commerce, 2009, pp. 99-106.
[50]S. H. Choi, Y.-S. Jeong, and M. K. Jeong, "A hybrid recommendation method with reduced data for large-scale application," Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, vol. 40, pp. 557-566, 2010..
[51]R.-D. Chiang, Y.-H. Wang, and H.-C. Chu, "Prediction of members’ return visit rates using a time factor," Electronic Commerce Research and Applications, vol. 12, pp. 362-371, 9// 2013.
[52]Cho, Yoon Ho, & Kim, Jae Kyeong. (2004). Application of Web usage mining and product taxonomy to collaborative recommendations in e-commerce. Expert systems with Applications, 26(2), 233-246. 
[53]Cho, Yoon Ho, Kim, Jae Kyeong, & Ahn, Do Hyun. (2005). A personalized product recommender for web retailers. Paper presented at the Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications, Jeju Island, Korea.
論文全文使用權限
校內
紙本論文於授權書繳交後5年公開
同意電子論文全文授權校園內公開
校內電子論文於授權書繳交後5年公開
校外
同意授權
校外電子論文於授權書繳交後5年公開

如有問題,歡迎洽詢!
圖書館數位資訊組 (02)2621-5656 轉 2487 或 來信