博碩士論文 954401018 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:46 、訪客IP:18.119.134.171
姓名 鍾震耀(Chen-yao Chung)  查詢紙本館藏   畢業系所 企業管理學系
論文名稱 以βΡ的方法在推薦系統中刪除惡意評價資料之研究
(βP: A Novel Approach to Filter out Malicious Rating Profiles from Recommender Systems)
相關論文
★ 在社群網站上作互動推薦及研究使用者行為對其效果之影響★ 以AHP法探討伺服器品牌大廠的供應商遴選指標的權重決定分析
★ 以AHP法探討智慧型手機產業營運中心區位選擇考量關鍵因素之研究★ 太陽能光電產業經營績效評估-應用資料包絡分析法
★ 建構國家太陽能電池產業競爭力比較模式之研究★ 以序列採礦方法探討景氣指標與進出口值的關聯
★ ERP專案成員組合對績效影響之研究★ 推薦期刊文章至適合學科類別之研究
★ 品牌故事分析與比較-以古早味美食產業為例★ 以方法目的鏈比較Starbucks與Cama吸引消費者購買因素
★ 探討創意店家創業價值之研究- 以赤峰街、民生社區為例★ 以領先指標預測企業長短期借款變化之研究
★ 應用層級分析法遴選電競筆記型電腦鍵盤供應商之關鍵因子探討★ 以互惠及利他行為探討信任關係對知識分享之影響
★ 結合人格特質與海報主色以類神經網路推薦電影之研究★ 資料視覺化圖表與議題之關聯
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   至系統瀏覽論文 ( 永不開放)
摘要(中) 隨著電子商務網站的普及化建立,消費者或顧客可以透過推薦系統的建議方便購物,而目前以協同過濾的方式來建構推薦系統為市場上的主要技術,為了廣泛收集消費者或顧客的意見與資料,推薦系統必須建構在網際網路環境中,此網路開放的特性同時也使得推薦系統比較容易遭受心懷不軌的人士操弄攻擊,利用灌入一些不公平的假評分資料來扭曲推薦系統所所提供的產品推薦排名,而達成其攻擊的目的。
近年來,為了解決推薦系統被攻擊的問題,已經有一些偵測攻擊的方法被提出,但是這些方法在應用上都有一些限制,由於在推薦系統中經常擁有大量遺失值(Missing Values),以主成分分析(Principal Components Analysis, PCA)為理論基礎的偵測方法必須事先加入大量替代值,此舉會使得整個推薦資料庫不真實;另外,以分類法(Classification)為基礎的偵測技術需要數量相當的真實資料與攻擊資料來訓練分類器,否則會造成分類不平衡(Imbalance)的問題,而實務上收集真實的攻擊資料並不容易;而以統計製程管制(Statistical Process Control, SPC)為基礎的偵測技術,必須在偵測之前取得被攻擊項目之評分機率分配,且仍無法完全移除攻擊者所產生的相關評分資料。為此,本研究在不需要前述方法的限制條件下,我們提出一個βP方法來消除這些被假評分的攻擊問題,而βP方法的理論基礎為統計上的Beta機率分配,βP方法除了容易計算,且透過實驗顯示此方法在MovieLens的推薦系統上對於攻擊資料有著非常穩定有效的過濾效果。
摘要(英) Recommender systems are widely deployed to provide user purchasing suggestion on eCommerce websites. The technology that has been adopted by most recommender systems is collaborative filtering. However, with the open nature of collaborative filtering recommender systems, they suffer significant vulnerabilities from being attacked by malicious raters, who inject profiles consisting of biased ratings.
In recent years, several attack detection algorithms have been proposed to handle the issue. Unfortunately, their applications are restricted by various constraints. PCA-based methods while having good performance on paper, still suffer from missing values that plague most user-item matrixes. Classification-based methods require balanced numbers of attacks and normal profiles to train the classifiers. The detector based on SPC (Statistical Process Control) assumes that the rating probability distribution for each item is known in advance. In this research, Beta-Protection (βP) is proposed to alleviate the problem without the abovementioned constraints. βP grounds its theoretical foundation on Beta distribution for easy computation and has stable performance when experimenting with data derived from the public websites of MovieLens.
關鍵字(中) ★ 攻擊偵測
★ 協同過濾
★ 推薦系統
關鍵字(英) ★ Shilling attacks detection
★ Collaborative filtering
★ Recommender systems
論文目次 INDEX
中文摘要 i
ABSTRACT ii
致謝 iii
INDEX v
LIST OF FIGURES vi
LIST OF TABLES vii
Chapter 1. Introduction 1
Chapter 2. Related Work 6
Chapter 3. The Proposed Methodology 11
3.1 The Problem Definition 13
3.2 Counting the probability of items being rated 15
3.3 Converting Likert ratings to Tri-Value ratings 18
3.4 Creating rating sets from Transformed matrix 20
3.5 The Algorithm of βP 24
Chapter 4. Evaluation of βP 29
4.1 Simulation dataset 29
4.2 Types of attacks 29
4.3 Adjusting quantiles 30
4.4 The protection provided by βP under various attacks 31
4.5 Compare and Contrast to the Performance of PCA methods 36
Chapter 5. Conclusion 38
References 40
LIST OF FIGURES
Figure 1. Identifying Raters Scoring Extremely Low Number of Items 26
Figure 2. Identifying Raters Given Extreme Scores 27
Figure 3. Filtering out Attackers 28
Figure 4. The Detection and False Alarm Rates with Various Quantiles and Filler Sizes under an Attack Size of 5% 31
Figure 5. Performance under Single-Target Push Attacks 33
Figure 6. Performance under Single-Target Nuke Attacks 33
Figure 7. Performance under Multiple-Target Push Attacks 35
Figure 8. Performance under Multiple-Target Nuke Attacks 35
Figure 9. PCA Methods under Single-Target Push Attacks 37
Figure 10. PCA Methods under Single-Target Nuke Attacks 37
LIST OF TABLES
Table 1 A Sample of a User-Item Matrix, R 17
Table 2 A Sample Transformed Matrix, T^3,4,5 19
Table 3 A Sample Transformed Matrix, T^1,2,3 20
參考文獻 References
[1] A. Jøsang, R. Ismail, C. Boyd, A Survey of Trust and Reputation Systems for Online Service Provision, Decision Support Systems. 43 (2) (2007) 618-644.
[2] A. Jøsang, R. Ismail, The Beta Reputation System, Proceedings of the 15th Bled Conference on Electronic Commerce Conference, 2002.
[3] A. Jøsang, S. Hird, E. Faccer, Simulating the Effect of Reputation Systems on e-Markets, Proceedings of the First International Conference on Trust Management, 2003.
[4] A. Whitby, A. Jøsang, J. Indulska, Filtering Out Unfair Ratings in Bayesian Reputation Systems, The Icfain Journal of Management Research. 4 (2) (2005) 48-64.
[5] B. Burke, B. Mobasher, C. Williams, R. Bhaumik, Classification Features for Attack Detection in Collaborative Recommender Systems, KDD ’06 Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2006.
[6] B. Mehta, T. Hofmann, P. Fankhauser, Lies and Propaganda: Detecting Spam Users in Collaborative Filtering, IUI ’07 Proceedings of the 12th International Conference on Intelligent User Interfaces, 2007.
[7] B. Mehta, Unsupervised Shilling Detection for Collaborative Filtering, AAAI ’07 Proceedings of the 22nd National Conference on Artificial Intelligence, 2007.
[8] B. Mehta, W. Nejdl, Unsupervised Strategies for Shilling Detection and Robust Collaborative Filtering, User Modeling and User-Adapted Interaction. 19 (1-2) (2009) 65–97.
[9] B. Mobasher, R. Burke, B. Bhaumil, C. Williams, Towards Trustworthy Recommender Systems: An Analysis of Attack Models and Algorithm Robustness, ACM Transactions on Internet Technology. 7 (4) (2007) 23-38.
[10] B. Sarwar, G. Karypis, J. Konstan, J. Riedl, Item-Based Collaborative Filtering Recommendation Algorithms, Proceedings of the 10th International World Wide Web Conference, ACM Press, 2001.
[11] C. T. Su, L. S. Chen, Y. Yih, Knowledge Acquisition through Information Granulation for Imbalanced Data, Expert System with Applications. 31 (3) (2006) 531-541.
[12] C. Williams, B. Mobasher, R. Burke, R. Bhaumik, J. Sandvig, Detection of Obfuscated Attacks in Collaborative Recommender Systems, ECAI’06 Proceedings of the 17th European Conference on Artificial Intelligence, 2006.
[13] F. Karakaya, N. G. Barnes, Impact of Online Reviews of Customer Care Experience on Brand or Company Selection, Journal of Consumer Marketing. 27 (5) (2010) 447-457.
[14] G. Adomavicius, A. Tuzhilin, Toward the Next Generation of Recommender Systems: A Survey of the State-Of-The-Art and Possible Extensions, IEEE Transactions on Knowledge and Data Engineering. 17 (6) (2005) 734-749.
[15] G. Linden, B. Smith, J. York, Amazon.com Recommendations: Item-to-item Collaborative Filtering. IEEE Internet Computing, 7 (1) (2003) 76-80.
[16] GroupLens Lab, MovieLens Data Set, http://www.grouplens.org/node/12, 2010.
[17] H. N. Kim, A. T. Ji, H. J. Kim, G. S. Jo, Error-Based Collaborative Filtering Algorithm for Top-N Recommendation, Lecture Notes in Computer Science. 4505 (2007) 594-605.
[18] J. A. Chevalier, D. Mayzlin, The Effect of Word of Mouth on Sales: Online Book Reviews, Journal of Marketing Research. 43 (3) (2006) 345-354.
[19] J. J. Sandvig, B. Mobasher, R. Burke, Robustness of Collaborative Recommendation Based On Association Rule Mining, RecSys ’07 Proceedings of the 2007 ACM Conference on Recommender Systems, ACM press, 2007.
[20] J. Konstan, B. Miller, D. Maltz, J. Herlocker, L. Gordon, J. Riedl, GroupLens: Applying Collaborative Filtering to Usenet News, Communications of the ACM. 40 (3) (1997) 77-87.
[21] J. Rutledge, B. Warner, Using the Beta Distribution on Confidence Intervals for Proportions, Proceedings of the Quality and Productivity Research Conference, 1999.
[22] Joe Roth, BBC News, Sony Admits Using Fake Reviewer, http://news.bbc.co.uk/1/hi/entertainment/film/1368666.stm, 2001.
[23] L. Yu, L. Liu, X. F. Li, A Hybrid Collaborative Filtering Method for Multiple-Interests and Multiple-Content Recommendation in E-Commerce, Expert Systems with Applications. 28 (1) (2005) 67-77.
[24] M. Deshpande, G. Karypis, Item-Based Top-N Recommendation Algorithms, ACM Transactions on Information Systems. 22 (1) (2004) 143–177.
[25] M. O’Mahony, N. J. Hurley, N. Kushmerick, G. C. M. Silvestre, Collaborative Recommendation: A Robustness Analysis, ACM Transactions on Internet Technology. 4 (4) (2004) 344-377.
[26] M. P. O’Mahony, N. J. Hurley, G. C. M. Silvestre, Promoting Recommendations: An Attack on Collaborative Filtering, Lecture Notes in Computer Science. 2453 (2002) 494-503.
[27] M. Papagelis, D. Plexousakis, T. Kutsuras, Alleviating the Sparsity Problem Collaborative Filtering Using Trust Inferences, Lecture Notes in Computer Science. 3477 (2005) 224-239.
[28] N. Hu, I. Bose, N. S. Koh, L. Liu, Manipulation of Online Reviews: An Analysis of Ratings, Readability, and Sentiments, Decision Support Systems. 52 (3) (2012) 674-684.
[29] N. Hu, I. Bose, Y. Gao, L. Liu, Manipulation in Digital Word-of-mouth: A Reality Check for Book Reviews, Decision Support Systems. 53 (3) (2011) 627-635.
[30] N. Hu, L. Liu, V. Sambamurthy, Fraud Detection in Online Consumer Reviews, Decision Support Systems. 50 (3) (2011) 614-626.
[31] N. J. Hurley, Z. Cheng, M. Zhang, Statistical Attack Detection, RecSys ’09 Proceedings of the third ACM conference on Recommender systems, ACM Press, 2009.
[32] P. A. Chirita, W. Nejdl, C. Zamfir, Preventing Shilling Attacks in Online Recommender Systems, WIDM ’05 Proceedings of the 7th Annual ACM International Workshop on Web Information and Data Management, ACM Press, 2005.
[33] P. J. Sher, S. H. Lee, Consumer Skepticism and Online Reviews: An Elaboration Likelihood Model Perspective, Social Behavior and Personality. 37 (1) (2009) 137-144.
[34] P. Massa, B. Bhattacharjee, Using Trust in Recommender Systems: An Experimental Analysis. Lecture Notes in Computer Science. 2995 (2004) 221-235.
[35] P. N. Tan, M. Steinbach, V. Kumar, Introduction to Data Mining, Addison Wesley, 2006.
[36] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, J. Riedl, GroupLens: An Open Architecture for Collaborative Filtering of Netnews, CSCW ‘94 Proceedings of Computer Supported Cooperative Work, 1994.
[37] R. Barandela, J. S. Sánchez, V. García, E. Rangel, Strategies for Learning in Class Imbalance Problems, Pattern Recognition. 36(3) (2003) 849-851.
[38] R. Bhaumik, C. Williams, B. Mobasher, R. Burke, Securing Collaborative Filtering Against Malicious Attacks Through Anomaly Detection, ITWP’06 Proceedings of the 4th Workshop on Intelligent Techniques for Web Personalization, at AAAI’06, Boston, 2006.
[39] R. Burke, B. Mobasher, C. Williams, R. Bhaumik, Detecting Profile Injection Attacks in collaborative Recommender Systems, CEC-EEE ’06 Proceedings of the 8th IEEE International Conference on E-Commerce Technology and the 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services, 2006.
[40] R. Jin, J. Y. Chai, L. Si, An Automatic Weighting Scheme for Collaborative Filtering, SIGIR ’04 Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2004.
[41] S. K. Lam, J. Riedl, Shilling Recommender Systems for Fun and Profit, WWW ’04 Proceedings of the 13th International Conference on World Wide Web, ACM press, 2004.
[42] S. Kotsiantis, D. Kanellopoulos, P. Pintelas, Handling Imbalanced Datasets: A Review, GESTS International Transactions on Computer Science and Engineering, 2006.
[43] S. Piramuthu, G. Kapoor, W. Zhou, S. Mauw, Input Online Review Data and Related Bias in Recommender Systems, Decision Support Systems. 53 (3) (2012) 418-424.
[44] S. Olsen, Amazon Blushes over Sex Link Gaffe, http://news.cnet.com/2100-1023-976435.html, 2002.
[45] Z. Zhang, Q. Ye, R. Law, Y. Li, The Impact of E-word-of-mouth on the Online Popularity of Restaurants: A Comparison of Consumer Reviews and Editor Reviews, International Journal of Hospitality Management. 29 (4) (2010) 694-700.
指導教授 許秉瑜(Ping-yu Hsu) 審核日期 2013-3-13
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明