Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 電機資訊學院
  3. 資訊工程學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/53880
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor林守德
dc.contributor.authorEric L. Leeen
dc.contributor.author李揚zh_TW
dc.date.accessioned2021-06-16T02:32:14Z-
dc.date.available2015-08-11
dc.date.copyright2015-08-11
dc.date.issued2015
dc.date.submitted2015-07-29
dc.identifier.citation[1] Parameswaran, A., Venetis, P., & Garcia-Molina, H. (2011). Recommendation systems with complex constraints: A course recommendation perspective. ACM Transactions on Information Systems (TOIS), 29(4), 20.
[2] Bendakir, N., & Aïmeur, E. (2006, July). Using association rules for course recommendation. In Proceedings of the AAAI Workshop on Educational Data Mining (Vol. 3).
[3] Ma, H., Zhou, D., Liu, C., Lyu, M. R., & King, I. (2011, February). Recommender systems with social regularization. In Proceedings of the fourth ACM international conference on Web search and data mining (pp. 287-296). ACM.
[4] Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2009, June). BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (pp. 452-461). AUAI Press.
[5] Koren, Y., Bell, R., & Volinsky, C. (2009). Matrix factorization techniques for recommender systems. Computer, (8), 30-37.
[6] T. Joachims, Training Linear SVMs in Linear Time, Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), 2006
[7] Bradley, A. P. (1997). The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern recognition, 30(7), 1145-1159.
[8] Pazzani, Michael J., and Daniel Billsus. 'Content-based recommendation systems.' The adaptive web. Springer Berlin Heidelberg, 2007. 325-341.
[9] Deshpande, Mukund, and George Karypis. 'Item-based top-n recommendation algorithms.' ACM Transactions on Information Systems (TOIS) 22.1 (2004): 143-177.
[10] Herlocker, Jonathan L., et al. 'An algorithmic framework for performing collaborative filtering.' Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 1999.
[11] Aizawa, Akiko. 'An information-theoretic perspective of tf–idf measures.'Information Processing & Management 39.1 (2003): 45-65.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/53880-
dc.description.abstract一個大學裡往往會有很多課程可供選擇,以台大為例,光2012年一年就有10572堂課可供選擇。對學生來說,在這些課程裡去做選擇是一件很花時間的事情。所以,這篇論文使用了學生過去的修課紀錄建立課程推薦系統。我們的課程推薦系統有兩個優點。第一點,跟之前的課程推薦系統的論文很不同的是,我們並沒有使用任何課程的資訊以及學生的成績或評價,而使有單純的使用學生選課的註冊紀錄,因此,保護了學生的隱私。第二點,跟之前的論文不一樣地方,ˊ之前的論文把任何一個物品當作是獨立的,但在我們這篇論文中,我們把每堂課當作不獨立的,所以更加提高了我們預測模型的表現。我們的實驗結果會顯示我們的課程推薦系統顯著地比傳統的推薦式系統還要來得好。zh_TW
dc.description.abstractUniversity students have to register for courses and usually there are many of those to choose from. It is time consuming for students check the course information for all courses before registration. As a result, this thesis proposes a recommender system to recommend courses to students based on the previous registration data of others. The advantage of our model is twofold. First, different from the previous works that require meta data about students or content information about courses, our model only needs the binary registration record of students for each course, thus protects the privacy of data provider. Second, different from the previous recommendation model that assumes items are independent, our model considers the courses-taken as a non-iid behavior to boost the performance. The experiment results show significant boost in our model comparing with the traditional recommender systems.en
dc.description.provenanceMade available in DSpace on 2021-06-16T02:32:14Z (GMT). No. of bitstreams: 1
ntu-104-R01922164-1.pdf: 759115 bytes, checksum: f9cdc1bfc2a3fd15452aded76b39d104 (MD5)
Previous issue date: 2015
en
dc.description.tableofcontents口試委員會審定書……………………………………………………………… i
誌謝………………………………………………………………………………. ii
中文摘要………………………………………………………………………… iii
英文摘要…………………………………………………………………………. iv
Chapter 1 Introduction …………………………………………………….. 1
Chapter 2 Related Work ……………………………………………………….. 5
Chapter 3 Methodology ………………………………………………………. 6
Chapter 4 Experiments ………………………………………………………. 25
Chapter 5 Conclusion …………………………………………………………. 29
Reference …………………………………………………………………………. 30
dc.language.isoen
dc.subject教育zh_TW
dc.subject機器學習zh_TW
dc.subject推薦系統zh_TW
dc.subject人工智慧zh_TW
dc.subject資料探勘zh_TW
dc.subjectData Miningen
dc.subjectEducationen
dc.subjectMachine Learningen
dc.subjectRecommender Systemen
dc.subjectArtificial Intelligenceen
dc.title利用協同式過濾模型建立考慮隱私的課程推薦系統zh_TW
dc.titleCollaborative Filtering Based Model for Privacy-Preserving Course Recommendationen
dc.typeThesis
dc.date.schoolyear103-2
dc.description.degree碩士
dc.contributor.oralexamcommittee蔡銘峰,蔡宗翰,顏嗣鈞,駱宏毅
dc.subject.keyword機器學習,推薦系統,人工智慧,資料探勘,教育,zh_TW
dc.subject.keywordMachine Learning,Recommender System,Artificial Intelligence,Data Mining,Education,en
dc.relation.page31
dc.rights.note有償授權
dc.date.accepted2015-07-29
dc.contributor.author-college電機資訊學院zh_TW
dc.contributor.author-dept資訊工程學研究所zh_TW
顯示於系所單位:資訊工程學系

文件中的檔案:
檔案 大小格式 
ntu-104-1.pdf
  未授權公開取用
741.32 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved