English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62830/95882 (66%)
Visitors : 4037746      Online Users : 550
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/114666


    Title: A dynamic time weight-based collaborative filtering recommendation system
    Other Titles: 以動態的時間權重為基礎的協同過濾系統
    Authors: 黃昱勳;Huang, Yu-Shiun
    Contributors: 淡江大學資訊工程學系碩士班
    陳以錚;Chen, Yi-Cheng
    Keywords: Collaborative Filtering;dynamic;Recommendation System;Time Weight;協同過濾;時間權重;動態;推薦系統
    Date: 2017
    Issue Date: 2018-08-03 15:00:06 (UTC+8)
    Abstract: 我們在此利用人類大腦記憶原理來給予不同的時間區段相對應的衰退函數:瞬時記憶等級、短期記憶等級、長期記憶等級,每當有一筆新的評級進來時,與其相關的項目群集就會被激活來到新的衰退等級(瞬時記憶等級),我們會設置一個門檻值,若是在一定時間內的激活次數小於門檻值的話,我們會給予相對應的懲罰,反之若是一個群集持續被激活的話,那我們會將他的衰退函數提升至更高的等級(短期記憶等級),同樣的若是在一定時間內激活次數小於門檻值的話,我們還是會給予他懲罰,而最後若是這個群集有持續被激活,我們會將他的衰退等級提升至最高級(長期記憶等級),一旦達到這個等級,就算之後的激活次數沒有達到門檻值也不會有懲罰,只是會讓它隨著他的衰退函數而下降。最後將衰退的權重加權在以項目為基礎的協同過濾系統的預測函數內,這是屬於後處理的方式。
    Traditional time weighted collaborative filtering systems have a single decay function. But, it is not reasonable that lets the weight decay by only function. We propose a method to solve it. In this paper, we propose a new method improve on time weighted collaborative filtering. We use the principle of human brain memory to give different time segments corresponding to the recession function: instantaneous memory level, short-term memory level, long-term memory level, whenever there is a new rating come in, and its related item cluster will be activated to a new recession level (instantaneous memory level). We set a threshold value. If the number of activations is less than the threshold for a certain period of time, we will give the corresponding penalty, otherwise we will raise his decay function to a higher level (short-term memory level), and so on. Once the long-term memory level is reached, even if the number of activations does not reach the threshold, there will be no penalty, but will let it fall with his decay function. Finally, the weight of the decay is weighted within the Item-based predictive function, which is a post-processing approach.
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Thesis

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML130View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback