針對時間有限的產品之以排名為基礎的推薦式系統

Ranking-based Recommendation System for Time-limited Products

陳彥齊(Yen-chi Chen)

指導教授 ： 林守德

國立臺灣大學/電機資訊學院/資訊工程學研究所/碩士(2015年)

https://doi.org/10.6342/NTU.2015.01547

摘要

在這份論文當中，我們解決了物品有生命時間限制的排序式推薦問題。我們考慮``時間有限'的物品可能會在某個時間點後失效。透過修改貝氏機率排序模型，這個模型能夠優化排序推薦，我們解決單一類別協同式過濾問題。

根據如此，我們提出兩個增強的模型，一、針對生命時間有限的物品，一個取負樣的技巧。二、一個可以把物品生命週期的時間特色模擬進來的模型。

透過在Kiva.org的資料實驗，我們驗證我們的增強模型有效。

關鍵字

推薦式系統 ； 時間有限產品 ； 矩陣分解

並列摘要

In this work, we solve the ranking-based recommendation task given products with limit life in predicting the preference rank of users on items.
We consider the `time-limit' items that can be expired after certain point. We propose to modify the Bayesian Personalize Ranking (BPR) framework to solve the one-class collaborative filtering problem, which directly optimizes the task for ranking. We proposed two enhancements: A time-limit negative sampling technique attempts to solve the ranking predicting task for time-limit items; and a time-aware model attempt to model the temporal effect in its whole life. Experiments on Kiva.org datasets show the merit of the proposed enhancement.

並列關鍵字

Recommendation system ； Time-limited products ； Matrix factorization

參考文獻

[4] D. Goldberg, D. Nichols, B. M. Oki, and D. Terry. Using collaborative filtering toweave an information tapestry.Commun. ACM, 35(12):61–70, Dec. 1992.

[5] Y. Koren. Collaborative filtering with temporal dynamics.Commun. ACM,53(4):89–97, Apr. 2010.

[8] R. Pan, Y. Zhou, B. Cao, N. Liu, R. Lukose, M. Scholz, and Q. Yang. One-classcollaborativefiltering. InData Mining, 2008. ICDM ’08. Eighth IEEE InternationalConference on, pages 502–511, Dec 2008.

[1] J. Choo, C. Lee, D. Lee, H. Zha, and H. Park. Understanding and promoting micro-finance activities in kiva.org. InProceedings of the 7th ACM International Confer-ence on Web Search and Data Mining, WSDM ’14, pages 583–592, New York, NY,USA, 2014. ACM

[2] M.DeshpandeandG.Karypis. Item-basedtop-nrecommendationalgorithms.ACMTrans. Inf. Syst., 22(1):143–177, Jan. 2004.