Session-Based Recommendation System for Social Network – Case Study on Tencent Weibo

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：35

、訪客IP：18.216.124.8

姓名

陳貞伶(Chen-Ling Chen) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

(Session-Based Recommendation System for Social Network – Case Study on Tencent Weibo)

相關論文

★ 行程邀約郵件的辨識與不規則時間擷取之研究	★ NCUFree校園無線網路平台設計及應用服務開發
★ 網際網路半結構性資料擷取系統之設計與實作	★ 非簡單瀏覽路徑之探勘與應用
★ 遞增資料關聯式規則探勘之改進	★ 應用卡方獨立性檢定於關連式分類問題
★ 中文資料擷取系統之設計與研究	★ 非數值型資料視覺化與兼具主客觀的分群
★ 關聯性字組在文件摘要上的探討	★ 淨化網頁：網頁區塊化以及資料區域擷取
★ 問題答覆系統使用語句分類排序方式之設計與研究	★ 時序資料庫中緊密頻繁連續事件型樣之有效探勘
★ 星狀座標之軸排列於群聚視覺化之應用	★ 由瀏覽歷程自動產生網頁抓取程式之研究
★ 動態網頁之樣版與資料分析研究	★ 同性質網頁資料整合之自動化研究

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

騰訊微博是中國最大的微博網站之一，騰訊微博上超過200萬的註冊用戶，每天產生超過40萬筆的消息。為了避免使用者處於資訊過載的狀況，因而，騰訊微博推薦使用者可能會感到有趣的項目。本篇論文為預測使用者是否會點擊跟隨騰訊微博所推薦的項目。論文分為兩大部分：第一部分為判斷使用者的喜好，第二部分則是判斷使用者是否專注於推薦項目上。判斷使用者喜好的部分，我們建立了多種Model based Collaborative Filtering模型以及Content based的模型來模擬使用者的喜好。第二部分則以資料的時間序列來建立Occupied model以模擬使用者處於何種狀態。最後，合併Occupied model與使用者喜好模型為最後的預測模型。在本篇論文我們以Session為單位來計算模型的Hamming loss，使用者喜好模型與Occupied model合併後的Hamming loss都會明顯下降，並達到最低的Hamming loss 0.13。

摘要(英)

Tencent Weibo is one of the largest micro-blogging websites in China. There are more than 200 million registered users on Tencent Weibo, generating over 40 million messages each day. Recommending appealing items to users is a mechanism to reduce the risk of information overload. The task of this paper is to predict whether or not a user will follow an item that has been recommended to the user by Tencent Weibo. The paper contains two parts: predicting users’ interests and distinguish whether the user is busy or available to browse recommended items. We apply several models based collaborative filtering as well as content-based filtering to capture users’ interests. Besides, we built an occupied model to distinguish users’ state and combined with recommendations methods as the final result. In the paper, we used session-based hamming loss as performance measure. The hamming loss of recommendation methods were greatly reduced (40%) above with occupied model from 0.187 to 0.13.

關鍵字(中)

★ 推薦系統
★ 矩陣分解
★ 協同過濾

關鍵字(英)

論文目次

中文摘要 i
Abstract ii
圖目錄 v
表目錄 vi
一、序論 1
1.1. 研究背景 2
1.2. 章節概要 4
二、相關研究 5
2.1. 矩陣分解（Matrix Factorization） 6
2.2. Information-Theoretic Co-clustering 7
2.3. KDD Cup 2012相關研究 8
2.3.1 Additive Forest model with Matrix Factorization models 8
2.3.2 Factorization Machines 9
2.3.3 Scorecard model with Matrix Factorization models 11
2.3.4 KDD Cup相關研究方法比較 12
三、Session-based騰訊微博推薦系統 13
3.1. 使用者喜好推薦方法 14
3.1.1 Factorization Machines模型 15
3.1.2矩陣分解模型 15
3.1.3共分群模型 17
3.1.4 新使用者與新項目處理方式 18
3.2. Occupied model 20
四、實驗 23
4.1. 實驗設置 23
4.2. 使用者喜好評估 26
4.2.1 參數設定 26
4.2.2 效能比較 29
4.3. Occupied Model 評估 32
4.4. Combined with Occupied Model 34
4.5. Analysis 36
五、結論與未來工作 40
參考文獻 41

參考文獻

[1] C. D. Meyer, ‘‘Matrix Analysis and Applied Linear Algebra”, SIAM, p. 514, 2000.
[2] D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, ‘‘Using Collaborative filtering to weave an information tapestry”, Communications of the ACM, Volume 35, Issue 12, pp61-70, 1992.
[3] D. D. Lee, H. S. Seung ‘‘Algorithms for non-negative matrix factorization”, In: Advances in Neural Information Processing Systems. 2000. 556−562, 2000.
[4] FICO, 2012, FICO Model Builder 7. http://www.fico.com/en/Products/DMTools/Pages/FICO-Model-Builder.aspx
[5] G. Golub and K. Kahan ‘‘Calculating the singular values and pseudo-inverse of a matrix.” Journal of the Society for Industrial and Applied Mathematics, 1965,2(2):205−224. [doi: 10.1137/0702016], 1965.
[6] G. Tsoumakas and I. Katakis, ‘‘Multi-Label Classification: An Overview”, International Journal of Data Warehousing & Mining, 3(3), 1-13, 2007.
[7] I. S. Dhillon, S. Mallela, and D. S. Modha, ‘‘Information-Theoretic Co-clustering”, Proceedings of The Ninth ACM SIGKDD Conference on Knowledge Discovery and Data Mining(KDD), pages 89-98, 2003.
[8] K. Kiwiel, ‘‘Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization”, SIAM Journal on Optimization (SIAMJO) 14(3):807-840, 2004.
[9] L. Liu and M. Tamer, ‘‘Mean Average Precision’’, Encyclopedia of Database Systems2009: 1703, 2009.
[10] LibFM: Factorization Machine Library. http://www.libfm.org/
[11] P. Melville and V. Sindhwani, ‘‘Recommender Systems”, Encyclopedia of Machine Learning 2010:829-838, 2010.
[12] R. Salakhutdinov and A. Mnih ‘‘Probabilistic matrix factorization.”, In: Advances in Neural Information Processing Systems. 2008,20(3): 451−432, 2008.
[13] S. Rendle, ‘‘Factorization machines with libFM”, ACM TIST 3(3):57, 2012.
[14] S. Rendle,‘‘Social Network and Click-through Prediction with Factorization Machines”, KDD-Cup Workshop, 2012.
[15] Tianqi Chen of team ACMClass@SJTU, ‘‘Combining Factorization Model and Additive Forest for Collaborative Followee Recommendation”, KDD-Cup Workshop, 2012.
[16] X. Zhao of team FICO Model Builder, ‘‘Scorecard with Latent Factor Models for User Follow Prediction Problem”, KDD-Cup Workshop, 2012.
[17] Y. Kluger, R. Basri, J. T. Chang and M. B. Gerstein, ‘‘Spectral Biclustering of Microarray Data: Coclustering Genes and Conditions”. Genome Research 13 (4): 703–716, 2003.
[18] Y. Koren, R. Bell, and C. Volinsky, ‘‘Matrix factorization techniques for recommender systems”, IEEE Computer 42(8):30-37, 2009.
[19] Y. Niu, Y. Wang, G. Sun, A. Yue, B. Dalessandro, C. Perlich, and B. Hamner, ‘‘The Tencent Dataset and KDD-Cup’12” KDD-Cup Workshop, 2012.

指導教授

張嘉惠(Chia-Hui Chang)

審核日期

2013-8-8

推文