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

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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113656/144643 (79%)
Visitors : 51739743 Online Users : 485

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 Informatics > Department of Computer Science > Theses > Item 140.119/113296

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

Title:	社群協同合作平台之推薦問題研究－以GitHub為例 A study of recommendations on social collaboration platforms : using GitHub as an example
Authors:	崔嘉祐 Tsui, Chia-Yu
Contributors:	蔡銘峰王釧茹 Tsai, Ming-Feng Wang, Chuan-Ju 崔嘉祐 Tsui, Chia-Yu
Keywords:	推薦協同過濾基於內容過濾分解機器 Recommendation Collaborative filtering Content-based filtering Factorizaction machine
Date:	2017
Issue Date:	2017-10-02 10:16:50 (UTC+8)
Abstract:	本論文提出一種在社群協作平台 GitHub 上的推薦方法,利用社群協作平台上的資訊於分解機器 ( Factorizaction Machines ,簡稱 FM ) 模型中。首先,我們抽取專案的協作關係、專案內的文字與程式碼,當作是特徵資訊加入模型中訓練,進而以模型的訓練結果去做推薦。我們利用 GitHub 平台上, 開發者對專案的行為 ( 如,給予的星號、關注、開分支編輯與貢獻 ) ,去建立開發者對專案感興趣評級,並產生使用者與專案的關係矩陣來當作我們的學習目標。藉由這樣的方法, 我們不僅能夠幫助模型收斂還能提升推薦的結果,而這種透過不同數量的相似特徵方法還可幫助使用者接觸到更多面向的物品。在實驗中, 不論是加入文字特徵還是程式碼特徵, 相較於傳統的推薦方法協同過濾,我們在平均精確均值 ( Mean Average Precision, MAP) 、召回率 ( Recall ) 與 F1 分數 ( F1 score ) 三個評估下都有較優秀的表現。最後,實驗結果顯示,在這種協作開發專案的 GitHub 社群協作平台上, 除了一般文字資訊外,程式碼資訊在推薦上是更有幫助的特徵資訊。 This paper proposes a recommendation approach based on Factorization Machines (FM) for GitHub, a social collaborative platform for program de- velopment. This work first extracts several features related to collaboration relationship and textual information within the project and the codes, and then incorporates the features into the model for training and learning. Lastly, the learned models are utilized for recommendation. This work skillfully uti- lizes the behaviors of developers toward a project, such as the star labeling, watch, fork, and contribution, to establish the degree of interest of a devel- oper has toward a project. Then, the proposed approach follows the con- struction of User-Item matrix for conducting the FM learning process. This approach not only expedites the convergence speed and the accuracy of FM, but it also enables users to explore the objects from different aspects. In the experiments, we compare the proposed approach with the traditional collab- oration filtering methods in terms of Mean Average Precision (MAP), Recall and F1 measures. The experimental results show that the proposed method outperforms the traditional user-based and item-based collaboration filtering methods. Furthermore, the experiment shows that, for social collaboration platform for program development, the incorporation of code feature is of greater enhancement than textual feature in the task of recommendation.
Reference:	[1] F. Aiolli. A preliminary study on a recommender system for the million songs dataset challenge. In Proceedings of the 2013 International Institute of Refriger- ation (IIR), pages 73–83. Citeseer, 2013. [2] P. Bedi, H. Kaur, and S. Marwaha. Trust based recommender system for seman- tic web. In Proceedings of the 2007 International Joint Conference on Artificial Intelligence (IJCAI), volume 7, pages 2677–2682, 2007. [3] M. Cha, A. Mislove, and K. P. Gummadi. A measurement-driven analysis of infor- mation propagation in the flickr social network. In Proceedings of the 18th Interna- tional Conference on World Wide Web, pages 721–730. ACM, 2009. [4] J. Davidson, B. Liebald, J. Liu, P. Nandy, T. Van Vleet, U. Gargi, S. Gupta, Y. He, M. Lambert, B. Livingston, et al. The youtube video recommendation system. In Proceedings of the 4th ACM Conference on Recommender Systems, pages 293–296. ACM, 2010. [5] D. Goldberg, D. Nichols, B. M. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. Communications of the ACM, 35(12):61–70, 1992. [6] D. Gruhl, R. Guha, D. Liben-Nowell, and A. Tomkins. Information diffusion through blogspace. In Proceedings of the 13th International Conference on World Wide Web, pages 491–501. ACM, 2004. [7] L. Hong, O. Dan, and B. D. Davison. Predicting popular messages in twitter. In Proceedings of the 20th International Conference Companion on World Wide Web, pages 57–58. ACM, 2011. [8] L. Hong, A. S. Doumith, and B. D. Davison. Co-factorization machines: modeling user interests and predicting individual decisions in twitter. In Proceedings of the 6th ACM International Conference on Web Search and Data Mining, pages 557– 566. ACM, 2013. [9] M. Jiang, P. Cui, R. Liu, Q. Yang, F. Wang, W. Zhu, and S. Yang. Social contex- tual recommendation. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pages 45–54. ACM, 2012. [10] G. Linden, B. Smith, and J. York. Amazon. com recommendations: Item-to-item collaborative filtering. IEEE Internet Computing, 7(1):76–80, 2003. [11] H. Ma, I. King, and M. R. Lyu. Learning to recommend with social trust ensemble. In Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 203–210. ACM, 2009. [12] P. Massa and P. Avesani. Trust-aware recommender systems. In Proceedings of the 2007 ACM Conference on Recommender Systems, pages 17–24. ACM, 2007. [13] I. Pila ́szy and D. Tikk. Recommending new movies: even a few ratings are more valuable than metadata. In Proceedings of the 3rd ACM Conference on Recom- mender Systems, pages 93–100. ACM, 2009. [14] S. Rendle. Factorization machines. In Processing of the 10th IEEE International Conference on Data Mining (ICDM), pages 995–1000. IEEE, 2010. [15] S. Rendle. Factorization machines with libfm. Proceedings of the 2012 ACM Trans- actions on Intelligent Systems and Technology (TIST), 3(3):57, 2012. [16] B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Item-based collaborative filtering recommendation algorithms. In Proceedings of the 10th International Conference on World Wide Web, pages 285–295. ACM, 2001. [17] J. Schafer, D. Frankowski, J. Herlocker, and S. Sen. Collaborative filtering recom- mender systems. The adaptive web, pages 291–324, 2007. [18] Y. Shi, A. Karatzoglou, L. Baltrunas, M. Larson, A. Hanjalic, and N. Oliver. Tfmap: optimizing map for top-n context-aware recommendation. In Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Infor- mation Retrieval, pages 155–164. ACM, 2012. [19] J. Weston, C. Wang, R. Weiss, and A. Berenzweig. Latent collaborative retrieval. arXiv preprint arXiv:1206.4603, 2012.
Description:	碩士國立政治大學資訊科學學系 104753034
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0104753034
Data Type:	thesis
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Size	Format
303401.pdf	1876Kb	Adobe PDF2	194	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