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

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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113325/144300 (79%)
Visitors : 51152982 Online Users : 926

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

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大典藏 > College of Commerce > Department of Statistics > Theses > Item 140.119/58670

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/58670

Title:	矩陣分解法對網路評比資料分析之探討 Matrix Factorization Techniques for Analysis of Online Rating Data
Authors:	張良卉
Contributors:	翁久幸 Ruby Chui-Hsing Weng 張良卉
Keywords:	推薦系統合作式推薦系統潛在因素模型矩陣分解法
Date:	2012
Issue Date:	2013-07-01 17:01:54 (UTC+8)
Abstract:	隨著科技的進步、網路的發達，我們生活在資訊爆炸的社會。許多企業網站或網路商店在將產品銷售給消費者的過程中，紛紛使用了推薦系統，商家使用網路作為行銷的手法，消費者也會透過網路尋找自己想要的產品，推薦系統就在這個環境中產生。　　推薦系統根據使用者的特性或喜好，將使用者可能會喜歡的資訊或實物推薦給使用者。推薦系統的運作方式分成兩大類，第一類是內容導向式推薦系統(content filtering approach)，對所有項目賦予一連串的屬性，再依照使用者的個人資料和項目屬性做比對，藉此推薦較符合該位使用者喜好的項目。第二類是合作式推薦系統(collaborative filtering approach)，此方法利用的是使用者彼此之間或是項目與項目之間的關係，其概念是：與使用者有類似喜好的人所喜歡的東西或是與使用者喜好的東西相似的物品，都可能是使用者也會喜歡的項目。其方便之處在於只需要使用者對項目的評分資料即可運作。　　合作式推薦系統又包含兩個領域，分別為鄰域法(neighborhood methods)和潛在因素模型(latent factor models)。鄰域法著重於使用者之間或項目之間的關係，根據所利用不同的關係又可分為項目導向與使用者導向兩種方法。潛在因素模型則試著從項目和使用者的評分關係中找出有何潛在因素，矩陣分解法(matrix factorization)即為其方法之一。　　本研究旨在探討矩陣分解法，矩陣分解法為合作式推薦系統中的潛在因素模型方法之一。矩陣分解法利用使用者對於項目特性的喜好和項目所具備的特性作為預測評分的準則，但會影響使用者評分的因素不只這些，可能還包括了使用者自己的衡量準則、或是項目本身的優良程度，因此可以將這些導致偏差的因素加入矩陣分解法的模型中來調整預測的結果。因此本研究想探討在加入偏差項以後的矩陣分解法是否能使預測的結果更準確。　　本研究使用來自Minnesota 大學GroupLens Research Project 中的MovieLens 資料來分析。在經過實證分析以後，我們發現加入偏差項的矩陣分解法比起矩陣分解法在預測上確實能夠提升預測的準確度，但會花較多的時間在運算上。 The explosive growth of the internet has led to information overload. Electronic retailers and content providers use recommender systems to meet a variety of special needs and tastes. The retailers use the internet as a marketing method, and the consumers use the internet to find the products they want. Recommender systems then appear. Such systems are particularly useful for entertainment products such as movies, music, and TV shows. Recommender systems recommend the products or the information users may like to them by their characteristic and preference. Recommender systems can be divided to two strategies. One is content filtering approach, which creates a profile for each user or product to characterize its nature. Another is collaborative filtering approach, which relies only on past user behavior without requiring the creation of explicit profiles. Collaborative filtering analyzes relationships between users and interdependencies among products to identify new user-item associations. The two primary areas of collaborative filtering are the neighborhood methods and latent factor models. Neighborhood methods are centered on computing the relationships between items or, alternatively, between users. Latent factor models are an alternative approach that tries to explain the ratings by characterizing both items and users on factors inferred from the ratings patterns. Matrix factorization techniques are some of the most successful realizations of latent factor models. One benefit of the matrix factorization approach to collaborative filtering is its flexibility in dealing with various data aspects and other application-specific requirements. It tries to capture the interactions between users and items that produce the different rating values. However, much of the observed variation in rating values is due to effects associated with either users or items, known as biases or intercepts, independent of any interactions. This research try to find out whether putting the biases into matrix factorization models makes the prediction more accurate. This research analyzed the MovieLens data from GroupLens Research Project of Minnesota University. We found that adding biasterms to matrix factorization can improve the accuracy of prediction, though it requires a bit more computing time.
Reference:	1. Paul Resnick, Neophytos Iacovou, Mitesh Suchak, Peter Bergstrom, and John Riedl (1994), “GroupLens: An Open Architecture for Collaborative Filtering of Netnews,” Proceedings of ACM 1994 Conference on Computer Supported Cooperative Work, Chapel Hill, pp. 175-186. 2. Joseph A. Konstan, Bradley N. Miller, David Maltz, Jonathan L. Herlocker, Lee R. Gordon, and John Riedl (1997), “GroupLens: Applying Collaborative Filtering to Usenet Nwes,” Comminications of the ACM, Mar1997, Vol. 40, Issue 3, pp. 77-87. 3. Kwok-Wai Cheung, Kwok-Ching Tsui, and Jiming Liu (2004), “Extended Latent Class Models for Collaborative Recommendation,” IEEE Transactions on Systems, Man Cybernetics: Part A, Jan 2004, Vol. 34, Issue 1, pp. 143-148. 4. Wenye Li, Kin-hong Lee, and Kwong-sak Leung (2006), “Generalized Regularized Least-Squares Learning with Predefined Features in a Hilbert Space,” Neural Information Processing Systems – NIPS, pp. 881-888. 5. J. Bennet, and S. Lanning, “The Netflix Prize,” KDD Cup and Workshop, 2007;www.netflixprize.com. 6. Daniel E. Ho, and Kevin M. Quinn (2008), “Improving the Presentation and Interpretation of Online Ratings Data with Model-Based Figures,” The Amreican Statistician, Nov 2008, Vol. 62, Issue 4, pp. 279-288. 7. Martijn Kagie, Matthijs van der Loos, and Michiel van Wezel (2009), “Including item characteristics in the probabilistic latent semantic analysis model for collaborative filtering,” AI Communications, 22, 2009, pp. 249-265. 8. Yehuda Koren, Robert Bell, and Chris Volinsky (2009), “Matrix Factorization Techniques for Recommender Systems,” IEEE Computer Society, Aug 2009, Vol.42, Issue 8, pp. 42-49. 9. Yehuda Koren (2010), “Collaborative Filtering with Temporal Dynamics,” Comminications of the ACM, APR 2010, Vol. 53, Issue 4, pp. 89-98. 10. 張孫浩 (2011), 網路評比資料之統計分析, 國立政治大學統計學系碩士論文 11. Netflix. Retrieved JUN, 2013, from http://www.netflix.com 12. Amazon. Retrieved JUN, 2013, from http://www.amazon.com 13. TiVo. Retrieved JUN, 2013, from http://www.tgc-taiwan.com.tw/index.php 14. GroupLens Research. Retrieved Nov, 2013, from http://www.grouplens.org
Description:	碩士國立政治大學統計研究所 100354028 101
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G1003540281
Data Type:	thesis
Appears in Collections:	[Department of Statistics] Theses

Files in This Item:

File	Size	Format
028101.pdf	925Kb	Adobe PDF2	794	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 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 © - Feedback