Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/71196
Title: | 藉由單類矩陣分解進行搜尋推薦 Trending Query Recommendation by One-class Matrix Factorization |
Authors: | Chuan-Yao Su 蘇傳堯 |
Advisor: | 林智仁(Chih-Jen Lin) |
Keyword: | 推薦系統,矩陣分解,梯度下降法,機器學習,隱性回饋,正例與未標注學習, Recommender system,Matrix factorization,Coordinate descent,Machine learning,Implicit feedback,PU learning, |
Publication Year : | 2018 |
Degree: | 碩士 |
Abstract: | 目前,對於有使用隱式用戶反饋的推薦系統,已經考慮了單類矩陣分解,但是,大多數現有工作都集中在方法論上。他們對一些公共或甚至人工生成的數據進行評估,而不是將他們的方法部署到大型推薦系統。因此,沒有討論到許多實際因素。在本文中,我們目標在通過提供在大規模趨勢查詢推薦服務上,應用一類矩陣分解的研究來填補這一空白。同時,我們也證明了此方法在推薦系統上有15%以上的改進。在方法論方面,基於實際數據,我們指出了過去工作中未涉及的一些計算瓶頸,並提供了有效率的訓練方法。 Recently, one-class matrix factorization has been considered for recommendation systems that have only implicit user feedbacks. However, most of existing works focus on the methodology. They conduct evaluations on some public or even artificially generated data, rather than deploying their approaches to a large production system. Therefore, many practical considerations are not discussed. In this thesis, we aim to fill the gap by providing an end-to-end study of applying one-class matrix factorization on a large-scale service of trending query recommendation. We discuss some practical challenges and demonstrate a more than 20\% improvement in our online production system. On the methodology side, based on properties of real data, we point out some computational bottlenecks not addressed in past works and provide efficient training procedures. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/71196 |
DOI: | 10.6342/NTU201801887 |
Fulltext Rights: | 有償授權 |
Appears in Collections: | 資訊工程學系 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
ntu-107-1.pdf Restricted Access | 1.3 MB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.