![]() |
|
以作者查詢圖書館館藏 、以作者查詢臺灣博碩士 、以作者查詢全國書目 、勘誤回報 、線上人數:20 、訪客IP:18.116.88.145
姓名 陳昱瑾(Yu-Ching Chen) 查詢紙本館藏 畢業系所 資訊工程學系 論文名稱 使用者行為分析與商品推薦應用於集點App
(User Behavior Analysis and Commodity Recommendation for Point-Earning App)相關論文 檔案 [Endnote RIS 格式]
[Bibtex 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
[下載]
- 本電子論文使用權限為同意立即開放。
- 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
- 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
摘要(中) 近年來網路普及,電子商務網站發展成熟,隨之而生的推薦系統發展蔚為風潮,如何幫助消費者從成千上萬的商品中,找到他所需要的商品,並在最短時間內將「對的商品」在「對的時間」推薦給「對的人」,是很重要的。另一方面,對於商家而言,能將推薦資訊精準的投放給有需要的顧客,為其首要目標。然而,推薦系統背後仰賴的是大量的數據和有效的分析,對於初創發展不久的企業來說是很大的問題。
本研究的資料來自一款以集點任務作為設計導向的App,我們透過消費者使用App的紀錄與登入時綁定的FB帳號來了解使用者的消費行為與基本資訊。此集點App主要合作的廠商為台灣某連鎖美妝零售商,其販售的商品有美妝、保養品、零食以及生活用品等,共2,177項商品。對於這種消費型商品的推薦與以往電影推薦不同,消費型商品與時間有很大的關係,而且會被使用者重複購買。
在本論文中,我們篩選出消費次數較高的使用者來分析,以解決資料不足的問題。此外,透過設計使用者特徵、商品特徵、使用者與商品的交互特徵以及時間相關的特徵,將資料透過Machine Learning的方法訓練,並建立預測模型,再對以時間切分後的測試資料進行預測。實驗數據顯示在Top5的F-measure由原本的0.0507提升至0.4413,藉此提升推薦系統的效能並進行較為有效的推薦。摘要(英) The E-commerce website is well developed due to the internet become more popular for the past few year. It is a trend in recommendation system. It is the most important thing, how can we recommend the right thing for the right person at the right moment in the short time. On the other side, the first topic for the store is how can we give an exact information for the customers who needed. However, recommendation system depends on a huge data and analysis. It will be a big problem for a new company.
This research data is from an App needs to collect point. We find out users’ profile and behavior from APP records and Facebook account. The App is mainly cooperate with a Taiwan makeup chained retailer, that it sells beauty, skin care products and some necessities, they have around 2,177 kinds of item. This kind of consumption recommended is different from the movie recommendation. Consumer product is related to the time and will be bought again by the user.
In my paper, we select some user, who purchase times is high to resolve the data is not enough. Otherwise, through user feature, item feature, feature between with user and item and related to time. Using Machine Learning to train and built up the forecast model to predicted the testing data by the time. Resulting in F-measure from 0.0507 to 0.4413, Structure leaning with time greatly enhances the efficiency of our recommendation system.關鍵字(中) ★ 推薦系統
★ 機器學習
★ 時間序列性推薦
★ Structure Learning關鍵字(英) 論文目次 摘要 i
Abstract ii
目錄 iii
圖目錄 iv
表目錄 v
1. 簡介 1
2. 相關研究 4
2.1. 推薦系統 4
2.2. 關鍵字提取 8
2.3. word2vec 9
3. 集點App資料介紹與問題定義 11
4. 系統架構、特徵設計與推薦方法 15
4.1. 資料集與特徵設計 15
4.1.1. 使用者特徵 16
4.1.2. 產品特徵 17
4.1.3. 使用者購買商品之因素特徵 20
4.2. Structure Learning 21
5. 實驗 26
5.1. 資料準備 26
5.1.1. 時序無關之資料準備 26
5.1.2. 時序相關之資料準備 27
5.2. 評估方法 28
5.3. 時序無關之推薦問題 29
5.4. 時序相關之推薦問題 31
6. 結論 35
參考 36參考文獻 [1] Melville, P., Mooney, R. J., & Nagarajan, R. (2002, July). Content-boosted collaborative filtering for improved recommendations. In Aaai/iaai (pp. 187-192).
[2] Schafer, J. B., Frankowski, D., Herlocker, J., & Sen, S. (2007). Collaborative filtering recommender systems. In The adaptive web (pp. 291-324). Springer Berlin Heidelberg.
[3] Mooney, R. J., & Roy, L. (2000, June). Content-based book recommending using learning for text categorization. In Proceedings of the fifth ACM conference on Digital libraries (pp. 195-204). ACM.
[4] Delgado, J., & Ishii, N. (1999). Memory-based weighted majority prediction. In SIGIR Workshop Recomm. Syst. Citeseer.
[5] Billsus, D., & Pazzani, M. J. (1998, July). Learning Collaborative Information Filters. In Icml (Vol. 98, pp. 46-54).
[6] Altman, N. S. (1992). An introduction to kernel and nearest-neighbor nonparametric regression. The American Statistician, 46(3), 175-185.
[7] Xu, B., Bu, J., Chen, C., & Cai, D. (2012, April). An exploration of improving collaborative recommender systems via user-item subgroups. In Proceedings of the 21st international conference on World Wide Web (pp. 21-30). ACM.
[8] Rendle, S. (2012). Factorization machines with libfm. ACM Transactions on Intelligent Systems and Technology (TIST), 3(3), 57.
[9] Banerjee, A., Dhillon, I., Ghosh, J., Merugu, S., & Modha, D. S. (2007). A generalized maximum entropy approach to bregman co-clustering and matrix approximation. Journal of Machine Learning Research, 8(Aug), 1919-1986.
[10] Li, B., Yang, Q., & Xue, X. (2009, July). Can Movies and Books Collaborate? Cross-Domain Collaborative Filtering for Sparsity Reduction. In IJCAI (Vol. 9, pp. 2052-2057).
[11] Wu, M. L., Chang, C. H., & Liu, R. Z. (2013). Co-clustering with augmented matrix. Applied intelligence, 39(1), 153-164.
[12] Murty, M. N., & Raghava, R. (2016). Support Vector Machines and Perceptrons: Learning, Optimization, Classification, and Application to Social Networks. Springer.
[13] Tsochantaridis, I., Joachims, T., Hofmann, T., & Altun, Y. (2005). Large margin methods for structured and interdependent output variables. Journal of machine learning research, 6(Sep), 1453-1484.
[14] Leskovec, J., Rajaraman, A., & Ullman, J. D. (2014). Mining of massive datasets. Cambridge university press.
[15] Mihalcea, R., & Tarau, P. (2004, July). TextRank: Bringing Order into Text. In EMNLP (Vol. 4, pp. 404-411).
[16] Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013). Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781.指導教授 張嘉惠 審核日期 2017-8-24 推文 plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
網路書籤 Google bookmarks
del.icio.us
hemidemi
myshare