論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available
論文名稱 Title |
使用信任網路在電子商務環境中產生推薦 Employing Trust Network for Recommendation in e-Commerce |
||
系所名稱 Department |
|||
畢業學年期 Year, semester |
語文別 Language |
||
學位類別 Degree |
頁數 Number of pages |
61 |
|
研究生 Author |
|||
指導教授 Advisor |
|||
召集委員 Convenor |
|||
口試委員 Advisory Committee |
|||
口試日期 Date of Exam |
2008-06-26 |
繳交日期 Date of Submission |
2008-07-28 |
關鍵字 Keywords |
電子商務、推薦系統、信任網路、佩吉評比 Trust Network, Recommender System, E-Commerce, PageRank |
||
統計 Statistics |
本論文已被瀏覽 5902 次,被下載 26 次 The thesis/dissertation has been browsed 5902 times, has been downloaded 26 times. |
中文摘要 |
身處於資訊超載的時代,許多人發現吸收資訊以及識別他們需要的資源是困難的。隨著電子商務的蓬勃發展,對消費者而言,在網路商店瀏覽、搜尋並且購買商品經常是一件費時且令人沮喪的事,許多想在電子商務網站購買商品的購物者,在離開網站時沒有發現他們想要的商品,因此,有很多電子商務網站實施推薦系統,打算為消費者提供各式各樣產品和服務的個人化推薦。近來有一些電子商務推薦系統的研究將社會影響納入考量,那些推薦系統可以達到較佳的預測正確性,而且可以克服以前方法的缺點。因此我們提出一個以信任網路為基礎的推薦架構,利用使用者之間的信任關係來產生推薦,我們使用了PageRank演算法來進行信任矩陣的調整以及產品推薦,另外,我們也提出了數個或許可以建立更佳信任矩陣的假設,並透過實驗來驗證,希望可以發現較好的方法來調整信任矩陣,最後我們提出了兩個方法來調整信任矩陣。針對推薦架構的每個階段,我們運用及評估信任矩陣調整和產品推薦方法的多種組合。使用Epinion.com資料的實驗結果顯示,針對不同的使用者群組使用不同的PageRank可以產生較佳的推薦結果,此外,我們提出了一個獲得最佳成果的混合方法。 |
Abstract |
Living in the information-overloading age, many people find it difficult to assimilate the information and to identify resources they need. As to a consumer, browsing, searching, and buying a product on online stores is often a time-consuming and frustrating task with the flourishing development of e-commerce. Many shoppers who are interested in buying products on E-commerce websites end up finding nothing they want. Therefore, many E-commerce websites have implemented recommender systems that intend to provide consumers with personalized recommendations for various types of products and services. Some recent research has taken into account social influence in recommender systems in E-commerce. These recommender systems have been observed to achieve better accuracy of prediction, and have also overcome some of the problems of the previous methods. In this study, we propose a trust network-based recommendation framework that utilizes the trust relationship between users to generate recommendation. We employ PageRank algorithm for trust matrix adjustment and recommendation. In addition, we propose several assumptions that can be used to construct trust matrix, and we verify them by experiments. We finally identify two approaches for adjusting trust matrix. Bases on the trust and rating data collected from Epinion.com, we exercise several alternatives and evaluated many combinations of trust matrix adjustment and recommendation methods. Our experiment evaluation results show that using different pagerank for different users groups can generate better recommendation results. Moreover, we proposed a best hybrid method that achieves the best performance. |
目次 Table of Contents |
CHAPTER 1 - Introduction 1 1.1 Background 1 1.2 Motivation 2 1.3 Thesis Organization 3 CHAPTER 2 - Literature Review 5 2.1 Recommender Systems 5 2.1.1 Content-based Methods 6 2.1.2 Collaborative Methods 8 2.2 Social Network Analysis 11 2.2.1 The Elements of Social Network 12 2.2.2 The Structural Properties of Social Network 13 2.2.3 Graph Theory 13 2.2.4 The Trust-Aware Recommendation 15 CHAPTER 3 - Recommendation Approaches Based on a Given Trust Network 19 3.1 Constructing the trust network 20 3.2 Using the trust network to enable recommendation 21 CHAPTER 4 - Experiment of Basic Approaches 25 4.1 Data Collection 25 4.2 Experiment and Result 26 4.2.1 Preliminary Experiment 27 4.2.2 Segmenting Users 29 CHAPTER 5 - Extended Approach 33 5.1 Asymmetric Approach 33 5.2 Confidence Approach 35 CHAPTER 6 - Experiments for Adjusted Trust Matrix 36 6.1 Experiment using asymmetric trust assignment 36 6.2 Experiment using confidence trust assignment 38 6.3 Using both trust assignment 40 6.4 Summary of Best Method of Segments 42 CHAPTER 7 - Conclusion 47 Reference 48 |
參考文獻 References |
Abdi, H. (2007). Z-scores. In N. Salkind, Encyclopedia of Measurement and Statistics. Thousand Oaks, CA: Sage. Adamic, L. A., & Adar, E. (2003). Friends and Neighbors on the Web. Social Networks , 211-230. Balabanovi, M., & Shoham, Y. (1997). Fab: content-based, collaborative recommendation. Commun ACM, (pp. 66-72). Cooley, R., Mobasher, B., & Srivastava, J. (1999). Data Preparation for Mining World Wide Web Browsing Patterns. Knowledge and Information Systems , 5-32. Deshpande, M., & Karypis, G. (2001). Selective markov models for predicting web-page accesses. Proceedings of the 1st International SIAM Conference on Data Mining. Gediminas, A., & Alexander, T. (2005). Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions. IEEE Trans. Knowled. Data Eng., (pp. 734-749). Golbeck, J., & Hendler, J. (2006). FilmTrust: Movie Recommendations using Trust in Web-Based Social Networks. Consumer Communications and Networking Conference 2006, (pp. 282-286). Golbeck, J., Hendler, J., & Parsia, B. (2003). Trust networks on the Semantic Web. In Proceedings of Cooperative Intelligent Agents. Goldberg, D., Nichols, D., Oki, B., & Terry, D. (1992). Using collaborative filtering to weave an information tapestry. Communications of the ACM , pp. 61-70. Graham, P. (2004). Web 2.0. The Web 2.0 Conference. Gross, J. L., & Yellen, J. (2004). Handbook of Graph Theory. CRC Press. Hanneman, R. A., & Riddle, M. (2005). Introduction to Social Network Methods. Retrieved from (http://faculty.ucr.edu/~hanneman/nettext/) Herlocker, J. L., Konstan, J. A., Borchers, A., & Riedl, J. (1999). An Algorithmic Framework for Performing Collaborative Filtering. Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, (pp. 230-237). Berkeley,CA. Hwang, S., & Chuang, S. (2004). Combining article content and web usage for literature recommendation in digital libraries. Online Information Review . Karypis, G., Aggarwal, R., Kumar, V., & Shekhar, S. (1999). Multilevel hypergraph partitioning: Application in VLSI domain. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, (pp. 69-79). Kautz, H., Selman, B., & Shah, M. (1997). Referral Web: Combining Social Networks and Collaborative Filtering. Communications of the ACM , 63-65. Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., L.R.Gordon, & Riedl, J. (1997). GroupLens:Applying Collaborative Filtering to Usenet News. Communications of the ACM , pp. 77-87. Krulwich, B., & Burkey, C. (1997). The InfoFinder agent: learning user interests through heuristic phrase extraction. Expert, IEEE [See also IEEE Intelligent Systems and their Applications], (pp. 22-27). Lam, C. (2004). SNACK: Incorporating Social Network Information in Automated Collaborative Filtering. Proceedings of the 5th ACM Conference on Electronic Commerce, (pp. 254-255). Levien, R. (2003). Advogato Trust Metric. UC Berkeley, USA. Liben-Nowell, D., & Kleinberg, J. (2003). The Link Prediction Problem for Social Networks. Proceedings of the Twelfth International Conference on Information and Knowledge Management, (pp. 556-559). Linden, G., Smith, B., & York, J. (2003). Amazon.com Recommendations: Item-to-Item Collaborative Filtering. IEEE Internet Computing , 7 (1), pp. 76-80. Massa, P., & Avesani, P. (2004). Trust-aware collaborative filtering for recommender systems. Proceedings of International Conference on Cooperative Information Systems. Agia Napa,Cyprus. Massa, P., & Bhattacharjee, B. (2004). Using trust in recommender systems: an experimental analysis. Proceedings of 2nd International Conference on Trust Managment. Oxford, England. Miller, B. N., Albert, I., Lam, S. K., Konstan, J. A., & Riedl, J. (2003). MovieLens Unplugged: Experiences with an Occasionally Connected Recommender System. Proceedings of International Conference on Intelligent User Interfaces. Mobasher, B., Cooley, R., & Srivastava, J. (1999). Creating adaptive web sites through usage-based clustering of URLs. IEEE Workshop on Knowledge and Data, (pp. 19-25). Mobasher, B., Dai, H., Luo, T., Sun, Y., & Zhu, J. (2000). Integrating web usage and content mining for more effective personalization. Proceedings of the International Conference on E-Commerce and Web Technologies, (pp. 165-76). Mooney, R. J., & Roy, L. (2000). Content-based book recommending using learning for text categorization. Proceedings of the Fifth ACM Conference on, (pp. 195-204). Newman, M. E. (2001). Clustering and Preferential Attachment in Growing Networks. Physical Review . Newman, M. E. (2001). Scientific Collaboration Networks. I. Network Construction and Fundamental results. American Physical Society Journals . Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The PageRank Citation Ranking: Bringing Order to the Web. Stanford, USA. Papagelis, M., Plexousakis, D., & Kutsuras, T. (2005). Alleviating the Sparsity Problem of Collaborative Filtering Using Trust Inferences. In Proceedings of the 3rd International Conference on Trust Management. LNCS. Rocquencourt, France: Springer-Verlag. Pazzani, M. J. (1999). A Framework for Collaborative, Content-Based and Demographic Filtering. Artif. Intell. Rev., (pp. 393-408). Pazzani, M., Muramatsu, J., & Billsus, D. (1996). Syskill & webert: Identifying interesting web sites. Proceedings of the National Conference on Artificial, (pp. 54-61). Pennock, D. M., Horvitz, E., Lawrence, S., & Giles, C. L. (2000). Collaborative filtering by personality diagnosis: A hybrid memory- and model-based approach. Proceedings of the Conference on Uncertainty in Artificial Intelligence, (pp. 473-480). Pitkow, J., & Pirolli, P. (1999). Mining longest repeating subsequences to predict world wide web surfing. Proceedings of USITS' 99: The 2nd USENIX Symposium on Internet Technologies & Systems, (pp. 139-50). Korfhage, R. R. (1997). Information Storage and Retrieval. Wiley Computer Pub . Resnick, P., & Varian, H. (1997). Recommender systems. Communications of the ACM , pp. 56-58. Resnick, P., Iacovou, N., Suchak, M., Bergstron, P., & Riedl, J. (1994). GroupLens:An Open Architecture for Collaborative Filtering of Netnews. Preceedings of the Conference on Computer Supported Cooperative Work(CSCW), (pp. 175-186). Chapel Hill, NC. Rucker, J., & Polanco, M. J. (1997). Siteseer: personalized navigation for the Web. Commun ACM, (pp. 73-76). Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2000). Analysis of recommendation algorithms for e-commerce. Proceedings of the 2nd ACM Conference on Electronic Commerce, (pp. 158-167). Silverman, B. G., Bachann, M., & Akharas, K. A. (2001). Implications of Buyer Decision Theory for Design of Ecommerce. International Journal of Human- , pp. 815-844. Sinha, R., & Swearingen, K. (2001). Comparing Recommendations Made by Online Systems and Friends. In Proceedings of the DELOS-NSF Workshop on Personalization and Recommender Systems in Digital Libraries. Dublin, Ireland. Srivastava, J., Cooley, R., Deshpande, M., & Tan, P. (2000). Web usage mining: Discovery and applications of usage patterns from web data. SIGKDD, (pp. 12-23). Staab, S., Domingos, P., Mika, P., Golbeck, J., Ding, L., Finin, T., et al. (2005). Social Networks Applied. IEEE Intelligent System , 80-93. Wasserman, S., & Faust, K. (1994). Social network analysis: methods and applictions. New York: Cambridge University Press . Wei, C., Shaw, M. J., & Easley, R. F. (2002). A Survey of Rrcommendation Systems in Electronic Commerce. In R. T. Kannan, E-Service: New Direction in Theory and Practice. M. E. Sharpe. Woon, T. Y., Jacobsen, M., Garcia-Molina, H., & Dayal, U. (1996). From User Access Patterns to Dynamic Hypertext Linking. Computer Networks . Yang, Q., Zhang, H. H., & Li, T. (2001). Mining web logs for prediction models in WWW caching and prefetching. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (pp. 473-478). Ziegler, C., & Lausen., G. (2004). Spreading activation models for trust propagation. IEEE International Conference on e-Technology, e-Commerce, and e-Service(EEE'04). |
電子全文 Fulltext |
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。 論文使用權限 Thesis access permission:校內一年後公開,校外永不公開 campus withheld 開放時間 Available: 校內 Campus: 已公開 available 校外 Off-campus:永不公開 not available 您的 IP(校外) 位址是 44.222.220.101 論文開放下載的時間是 校外不公開 Your IP address is 44.222.220.101 This thesis will be available to you on Indicate off-campus access is not available. |
紙本論文 Printed copies |
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。 開放時間 available 已公開 available |
QR Code |