請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60843
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 許永真(Yung-Jen Hsu) | |
dc.contributor.author | Wei-Lun Su | en |
dc.contributor.author | 蘇緯倫 | zh_TW |
dc.date.accessioned | 2021-06-16T10:32:42Z | - |
dc.date.available | 2013-08-22 | |
dc.date.copyright | 2013-08-22 | |
dc.date.issued | 2013 | |
dc.date.submitted | 2013-08-14 | |
dc.identifier.citation | [1] F. Abel, E. Herder, G.-J. Houben, N. Henze, and D. Krause. Cross-system user modeling and personalization on the social web. User Modeling and User-Adapted Interaction, 23:169–209, 2013.
[2] G.AdomaviciusandY.Kwon.Improvingaggregaterecommendationdiversityusing ranking-based techniques. IEEE Transactions on Knowledge and Data Engineering, 24(5):896–911, 2012. [3] G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender sys- tems: a survey of the state-of-the-art and possible extensions. Knowledge and Data Engineering, IEEE Transactions on, pages 734– 749, 2005. [4] N. Aizenberg, Y. Koren, and O. Somekh. Build your own music recommender by modeling internet radio streams. In Proceedings of the 21st international conference on World Wide Web, pages 1–10. ACM, 2012. [5] M. Azak. Crossing: A framework to develop knowledge-based recommenders in cross domains. Master’s thesis, Middle East Technical University, 2010. [6] R.M.Bell,Y.Koren,andC.Volinsky.Thebellkorsolutiontothenetflixprize,2007. [7] S. Berkovsky, T. Kuflik, and F. Ricci. Cross-domain mediation in collaborative filtering. In C. Conati, K. McCoy, and G. Paliouras, editors, User Modeling 2007, volume 4511 of Lecture Notes in Computer Science, pages 355–359. Springer Berlin Heidelberg, 2007. 43 [8] S. Berkovsky, T. Kuflik, and F. Ricci. Distributed collaborative filtering with do- main specialization. In Proceedings of the 2007 ACM conference on Recommender systems, RecSys ’07, pages 33–40, New York, NY, USA, 2007. ACM. [9] N. D. Buono and T. Politi. A continuous technique for the weighted low-rank ap- proximation problem. In ICCSA (2)’04, pages 988–997, 2004. [10] B. Cao, N. N. Liu, and Q. Yang. Transfer Learning for Collective Link Prediction in Multiple Heterogenous Domains. In International Conference on Machine Learning, pages 159–166, 2010. [11] P. Cremonesi, A. Tripodi, and R. Turrin. Cross-domain recommender systems. In Data Mining Workshops (ICDMW), 2011 IEEE 11th International Conference on, pages 496 –503, dec. 2011. [12] Y. Hu, Y. Koren, and C. Volinsky. Collaborative filtering for implicit feedback datasets. In Data Mining, 2008. ICDM’08. Eighth IEEE International Conference on, pages 263–272. IEEE, 2008. [13] M. Kaminskas and F. Ricci. Location-adapted music recommendation using tags. In J. Konstan, R. Conejo, J. Marzo, and N. Oliver, editors, User Modeling, Adaption and Personalization, volume 6787 of Lecture Notes in Computer Science, pages 183– 194. Springer Berlin Heidelberg, 2011. [14] D. Kelly and J. Teevan. Implicit feedback for inferring user preference: a bibliogra- phy. SIGIR Forum, 37(2):18–28, Sept. 2003. [15] Y.Koren,R.Bell,andC.Volinsky.Matrixfactorizationtechniquesforrecommender systems. IEEE Computer, pages 30–37, 2009. [16] Y. Koren and J. Sill. Ordrec: an ordinal model for predicting personalized item rating distributions. In Proceedings of the fifth ACM conference on Recommender systems, pages 117–124. ACM, 2011. 44 [17] B. Lariviere and D. Van den Poel. Investigating the role of product features in pre- venting customer churn by using survival analysis and choice modeling: the case of financial services. Expert Sys. with Applications 27, pages 277–285, 2004. [18] B. Li. Cross-domain collaborative filtering: A brief survey. In Tools with Artificial Intelligence (ICTAI), 2011 23rd IEEE International Conference on, pages 1085 – 1086, nov. 2011. [19] B. Li, Q. Yang, and X. Xue. Can movies and books collaborate? cross-domain collaborative filtering for sparsity reduction. Proceedings of the Twenty-First Inter- national Joint Conference on Artificial Intelligence, 2009. [20] B. Li, Q. Yang, and X. Xue. Transfer learning for collaborative filtering via a rating- matrix generative model. In Proceedings of the 26th Annual International Confer- ence on Machine Learning, ICML ’09, pages 617–624, New York, NY, USA, 2009. ACM. [21] B. Li, X. Zhu, R. Li, C. Zhang, X. Xue, and X. Wu. Cross-domain collaborative filtering over time. In Proceedings of the Twenty-Second international joint confer- ence on Artificial Intelligence - Volume Volume Three, IJCAI’11, pages 2293–2298. AAAI Press, 2011. [22] Y. Z. M. Z. Y. Liu and S. M. S. Feng. Localized matrix factorization for recommen- dation based on matrix block diagonal forms. [23] C.-C. Ma. Large-scale collaborative filtering algorithms. Master’s thesis, National Taiwan University, 2008. [24] T. G. McKenzie, C. S. Ferng, Y. N. Chen, C. L. Li, C. H. Tsai, K. W. Wu, Y. H. Chang, C. Y. Li, W. S. Lin, S. H. Yu, C. Y. Lin, P. W. Wang, C. M. Ni, W. L. Su, T. T. Kuo, C. T. Tsai, P. L. Chen, R. B. Chiu, K. C. Chou, Y. C. Chou, C. C. Wang, C. H. Wu, H. T. Lin, C. J. Lin, and S. D. Lin. Novel models and ensemble techniques to discriminate favorite items from unra ted ones for personalized music recommendation. 2011. 45 [25] P. Melville, R. J. Mooney, and R. Nagarajan. Content-boosted collaborative filtering for improved recommendations. In Proceedings of the Eighteenth National Confer- ence on Artificial Intelligence (AAAI-02), pages 187–192, Edmonton, Alberta, 2002. [26] A. Mnih and R. Salakhutdinov. Probabilistic matrix factorization. In Advances in neural information processing systems, pages 1257–1264, 2007. [27] D. Oard and J. Kim. Implicit feedback for recommender systems. pages 31–36, 1998. [28] R. Pan, Y. Zhou, B. Cao, N. Liu, R. Lukose, M. Scholz, and Q. Yang. One-class collaborative filtering. In Data Mining, 2008. ICDM ’08. Eighth IEEE International Conference on, pages 502–511, Dec. [29] W. Pan, N. N. Liu, E. W. Xiang, and Q. Yang. Transfer learning to predict missing ratings via heterogeneous user feedbacks. In IJCAI’11, pages 2318–2323, 2011. [30] W. Pan, E. W. Xiang, and Q. Yang. Transfer learning in collaborative filtering with uncertain ratings. In AAAI’12, pages –1–1, 2012. [31] W. Pan, W. Xiang, N. N. Liu, and Q. Yang. Transfer learning in collaborative filter- ing for sparsity reduction. Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10), 2010. [32] M. Papagelis, D. Plexousakis, and T. Kutsuras. Alleviating the sparsity problem of collaborative filtering using trust inferences. Trust management, pages 125–140, 2005. [33] M. Piotte and M. Chabbert. The pragmatic theory solution to the netflix grand prize. Netflix prize documentation, 2009. [34] S. Rendle, C. Freudenthaler, Z. Gantner, and S.-T. Lars. Bpr: Bayesian personalized ranking from implicit feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI ’09, pages 452–461, Arlington, Virginia, United States, 2009. AUAI Press. 46 [35] B.Sarwarand,G.Karypis,J.Konstan,andJ.Reidl.Item-basedcollaborativefiltering recommendation algorithms. 10th Int. Conf. on World Wide Web, pages 285–295, 2001. [36] D. Seung and L. Lee. Algorithms for non-negative matrix factorization. Advances in neural information processing systems, 13:556–562, 2001. [37] Y. Shi, M. Larson, and A. Hanjalic. List-wise learning to rank with matrix factor- ization for collaborative filtering. In Proceedings of the fourth ACM conference on Recommender systems, pages 269–272. ACM, 2010. [38] A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’08, pages 650–658, New York, NY, USA, 2008. ACM. [39] J. Tang, S. Wu, J. Sun, and H. Su. Cross-domain collaboration recommendation. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD ’12, pages 1285–1293, New York, NY, USA, 2012. ACM. [40] W. Wang, Z. Chen, J. Liu, Q. Qi, and Z. Zhao. User-based collaborative filtering on cross domain by tag transfer learning. In Proceedings of the 1st International Work- shop on Cross Domain Knowledge Discovery in Web and Social Network Mining, CDKD ’12, pages 10–17, New York, NY, USA, 2012. ACM. [41] P.WinotoandT.Tang.Ifyoulikethedevilwearspradathebook,willyoualsoenjoy the devil wears prada the movie? a study of cross-domain recommendations. New Generation Computing, 26:209–225, 2008. [42] L. Xiong, X. Chen, T.-K. Huang, J. Schneider, and J. G. Carbonell. Temporal col- laborative filtering with bayesian probabilistic tensor factorization. In Proceedings of SIAM Data Mining, volume 2010, 2010. 47 [43] J. Yoo and S. Choi. Weighted nonnegative matrix co-tri-factorization for collabora- tive prediction. In Z.-H. Zhou and T. Washio, editors, Advances in Machine Learn- ing, volume 5828 of Lecture Notes in Computer Science, pages 396–411. Springer Berlin Heidelberg, 2009. [44] Y.Zhang,B.Cao,andD.-Y.Yeung.Multi-domaincollaborativefiltering.InUAI’10, pages 725–732, 2010. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60843 | - |
dc.description.abstract | 集合多份推薦系統的資料群集有利於系統更瞭解使用者的喜好,系 統也因此可以推薦給使用者更好的商品清單,包括了跨站商品的推薦 以及原站的站內商品推薦。欲達成此目的,最簡單的方法就是直接將 多組資料視為一組資料,最後使用傳統的單領域推薦系統來學習使用 者喜好。然而,這可能會讓資料變得疏鬆以及多領域間的交互影響使 效用變低。大多數的跨領域系統是直接分析多組資料內使用者給的分 數,但是這種方式會因為同時去過兩個領域的重疊使用者太少而使得 結果變差。另外,這些方法都是使用人造切割成多領域的資料,並針 對使用者明回饋資料來分析。在這篇論文裡,我們提出了一個新的方 法,Content information as bridge across Multiple Domains Collaborative Filtering (CMDCF),是一個處理隱回饋多領域的推薦系統。在 CMDCF 裡,物品的資訊被用來連接多領域的一個依據而不只是使用者給的分 數。我們的實驗做在兩份真實的資料上面,與目前最好的方法來比較, 對於不同比例的重疊使用者,CMDCF 都能有效的猜出使用者喜好,並 且對於低重複使用者比例的資料有好的容忍度。除此之外,我們的方 法本身就可以減少在線上系統常會遇到的新使用者和新商品的問題。 | zh_TW |
dc.description.abstract | Integrating data from multiple recommender systems helps us understand user preference more, which make us able to provider more useful recom- mendations including inter-domain and intra-domain recommendations. The simplest method is to merge multiple data set as one and directly adopt single domain recommendation methods. However, this will make the data more fragmentary and debase the overall performance. Most of previous related approaches directly analyze ratings from the integrated matrix to infer user performance, it always suffer from low percentage of overlapping users. Fur- thermore, they all demonstrate on synthetic data with explicit feedback. In this thesis, we propose a novel approach, Content information as bridge across Multiple Domains Collaborative Filtering (CMDCF), to effectively integrate multiple recommendation domains with implicit feedback. In CMDCF, con- tent information is utilized to construct links across multiple similar data sources. Experiments on two real online data sets with various amount of common overlapping users demonstrate the effectiveness and the high tolerance about overlapping user amount of CMDCF toward state-of-the-art methods. In ad- dition, our method inherently has good resistance against new user/item prob- lem, which usually occurs in the online environment. | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T10:32:42Z (GMT). No. of bitstreams: 1 ntu-102-R00922050-1.pdf: 6308371 bytes, checksum: 900e0524eecd3cf224ca890f71356cf4 (MD5) Previous issue date: 2013 | en |
dc.description.tableofcontents | 口試委員會審定書 iii
誌謝 v 摘要 vii Abstract ix 1 Introduction 1 1.1 Motivation.................................. 1 1.2 Background and Proposed Method ..................... 2 1.3 Thesis Organization ............................. 4 2 Related Work 5 2.1 Recommender System ........................... 5 2.2 Cross-domain Approaches ......................... 6 2.3 Correlation between Domains ....................... 9 2.4 Types of User Feedback .......................... 10 3 Problem Definition 13 3.1 Data Representation............................. 13 3.2 Cross-Domain Recommendations Based on Multiple Sources . . . . . . 14 3.2.1 Goal................................. 14 3.2.2 Symbol Table............................ 15 4 Methodology 17 4.1 Matrix Factorization ............................ 17 4.2 Proposed Method .............................. 19 4.2.1 Items Modeling........................... 19 4.2.2 Users Modeling........................... 21 4.2.3 Intermediate Ratings ........................ 22 4.2.4 Multiple Domains Adaption .................... 22 4.2.5 Optimization ............................ 24 4.3 NewItems Modeling ............................ 27 4.4 NewUsers and Non-active Users Modeling . . . . . . . . . . . . . . . . 27 4.5 Complexity Analysis ............................ 28 5 Experiments 29 5.1 Experimental Setup............................. 29 5.1.1 Data Sets .............................. 29 5.1.2 Experimental Protocol ....................... 31 5.1.3 Evaluation Functions........................ 32 5.2 Methods for Comparison .......................... 33 5.3 Experimental Results ............................ 33 5.3.1 Evaluate on Real Data Sets..................... 34 5.3.2 Impact of Overlapping Users.................... 36 5.4 Correlations between Similarity and Performance . . . . . . . . . . . . . 39 6 Conclusion 41 6.1 Summery and Contribution......................... 41 6.2 Restrictions ................................. 42 6.3 Future Work................................. 42 Bibliography 43 | |
dc.language.iso | en | |
dc.title | 基於多種資料群集之隱回饋跨領域推薦系統 | zh_TW |
dc.title | Cross-domain recommender system based on multiple data integration with implicit feedback | en |
dc.type | Thesis | |
dc.date.schoolyear | 101-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 林守德(Shou-De Lin),陳信希(Hsin-Hsi Chen),蔡宗翰(Tzong-Han Tsai),黃漢申(Han-Shen Huang) | |
dc.subject.keyword | 推薦系統,跨領域,推薦演算法,隱回餽,協同過濾, | zh_TW |
dc.subject.keyword | recommender system,recommendation algorithm,implicit feedback,collaborative filtering, | en |
dc.relation.page | 48 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2013-08-14 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-102-1.pdf 目前未授權公開取用 | 6.16 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。