政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/131493

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/131493

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文笔数/总笔数 : 112871/143842 (78%)
造访人次 : 49948040 在线人数 : 538

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

搜寻范围

查询小技巧：

您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果

若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据

进阶搜寻

主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于政大典藏 ‧ 管理

到手机版

政大機構典藏 > 商學院 > 資訊管理學系 > 學位論文 > Item 140.119/131493

请使用永久网址来引用或连结此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/131493

题名:	以類神經網路解決情境式推薦問題 A Neural Network Approach to the Contextual-Bandit Problem
作者:	陳高欽 Chen, Kao-Chin
贡献者:	林怡伶蕭舜文 Lin, Yi-Ling Hsiao, Shun-Wen 陳高欽 Chen, Kao-Chin
关键词:	情境式推薦多選項推薦神經網路推薦系統 contextual bandit multi-armed bandit neural network recommendation system
日期:	2020
上传时间:	2020-09-02 11:46:11 (UTC+8)
摘要:	為了向用戶提供合適的商品推薦，推薦系統已在市場中廣泛應用。儘管市場上衝刺著各種可以使用的數據分析，但是冷啟動（Cold Start）問題對於新進用戶來說仍然是一個大問題。許多最新的推薦算法在假設用戶和商品保持線性關係的前提下設計了演算法，而實際上大多數情況下兩者間存在非線性關係。這項研究開發了一種使用神經網絡（NN）和情境式是推薦的演算法來處理非線性特徵和探索利用的權衡。推薦系統可以有效地預測新進用戶的喜好，還可以快速探索快速變化的喜好。通過將貝葉斯網絡（Bayesian networks）和自動編碼器（AE）集成到NN中，我們的系統, NN Contextual Bandit（NNCB）可以利用不同程度的探索和開發。因此，我們的系統能快速適應情境的變化。我們採用真實世界中的影片評分數據集來證明所提出系統的有效性，與傳統的情境是推薦演算法相比，該系統大約4％的優於就演算法。 Recommendations have been wildly applied in marketplaces to provide right items to users. While various heterogeneous data available in marketplaces, the cold start problem is still a big issue for newcomers. Many state-of-the-art recommendation algorithms were designed on the assumption that users and items remain a linear relationship, while most cases exist nonlinear relationship in reality. This study develops an algorithm using neural network (NN) and contextual bandit to deal with nonlinear context and explore-exploit tradeoff. The recommendation system could effectively predict newcomers’ preferences and also provide quick exploration for fast- changing preferences. By integrating Bayesian networks and AutoEncoder (AE) in the NN, our system, NN Contextual Bandit (NNCB), could leverage different levels of exploration and exploitation. Thus, the proposed recommendation can quickly adapt to the real-time context. We adopt real-world video rating dataset to demonstrate the effectiveness of the proposed system which improve 4% regret as the conventional bandit algorithms.
參考文獻:	Akter, S., & Wamba, S. F. (2016). Big data analytics in E-commerce: a systematic review and agenda for future research. Electronic Markets, 26(2), 173–194. https://doi.org/10.1007/s12525-016-0219-0 Auer, P., & Ortner, R. (2010). UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem. Periodica Mathematica Hungarica, 61(1), 55–65. https://doi.org/10.1007/s10998-010-3055-6 Blundell, C., Cornebise, J., Kavukcuoglu, K., & Wierstra, D. (2015). Weight Uncertainty in Neural Networks. Proceedings of the 32nd International Conference on Machine Learning, Lille, France, 2015. JMLR: W&CP Volume 37. Copy- Right 2015 by the Author(S)., 37. https://doi.org/10.1002/etc.712 Chu, W., Li, L., Reyzin, L., & Schapire, R. E. (2011). Contextual bandits with linear Payoff functions. Journal of Machine Learning Research, 15, 208–214. Kingma, D. P., & Welling, M. (2013). Auto-encoding variational bayes. ArXiv Preprint ArXiv:1312.6114. Kiron, D., Prentice, P. K., & Ferguson, R. B. (2014). The Analytics Mandate. MIT Sloan Management Review, 55(4), 1. Li, L., Chu, W., Langford, J., & Schapire, R. E. (2010). A contextual-bandit approach to personalized news article recommendation. Proceedings of the 19th International Conference on World Wide Web, WWW ’10, 661–670. https://doi.org/10.1145/1772690.1772758 Liu, B., Wei, Y., Zhang, Y., Yan, Z., & Yang, Q. (2018). Transferable Contextual Bandit for Cross-Domain Recommendation. Aaai, 3619–3626. Schafer, J. Ben, Konstan, J. A., & Riedl, J. (2001). E-commerce recommendation applications. Data Mining and Knowledge Discovery, 5(1–2), 115–153. Sivapalan, S., Sadeghian, A., Rahnama, H., & Madni, A. M. (2014). Recommender systems in e-commerce. World Automation Congress Proceedings, 179–184. https://doi.org/10.1109/WAC.2014.6935763 Slivkins, A. (2019). Introduction to Multi-Armed Bandits. (January 2017). Retrieved from http://arxiv.org/abs/1904.07272 Zhou, L., & Brunskill, E. (2016). Latent contextual bandits and their application to personalized recommendations for new users. IJCAI International Joint Conference on Artificial Intelligence, 2016-Janua, 3646–3653.
描述:	碩士國立政治大學資訊管理學系 107356016
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0107356016
数据类型:	thesis
DOI:	10.6814/NCCU202001541
显示于类别:	[資訊管理學系] 學位論文

文件中的档案:

档案	描述	大小	格式	浏览次数
601601.pdf		1075Kb	Adobe PDF2	0	检视/开启

在政大典藏中所有的数据项都受到原著作权保护.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - 回馈