透過您的圖書館登入
IP:18.188.20.56
  • 學位論文

串流資料演算法於推薦系統的應用

Application of Streaming Data Algorithms to Recommender System

指導教授 : 陳景祥

摘要


近年來,由於資訊科技的發達,資料的種類越來越多元,因此串流資料(Data stream)也成為重要的研究領域,例如電子商務採購、網頁點擊資料、電話通訊資料、信用卡交易資訊等等。這些資料需依個別記錄按照順序處理,這樣才能快速因應所發生的各種狀況,並在需要時即時做出反應。 本論文探討分群串流資料演算法(clustering data stream algorithm)應用在推薦系統時,是否能更有效率的給予即時且精準的推薦商品,並以公開的MovieLen資料集中使用者對於電影的評分資訊,比較K-means與Affinity Propagation Clustering這兩種分群算法,比較推薦結果的差異,以達到最佳推薦,發掘用戶潛在喜好的商品為目標。

並列摘要


In recent years, due to the development of information technology and the variety of data types, streaming data has become an important research area, such as e-commerce purchasing, web page click data, telephone communication data, credit card transaction information, etc. Since the large volumes of data arriving in a stream, most traditional algorithms might be not efficient. This thesis discusses whether the data stream clustering algorithm can be used to recommend real-time and accurate recommended products. Based on MovieLens movie review dataset, we develop and compare movie recommender system using data stream clustering algorithm to achieve the best recommendation and explore the potential products of users.

參考文獻


英文文獻
1. Adomavicius G., Tuzhilin A.(2005). 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,pp.734-749
2. Aggarwal C.C., Han J., Wang J., Yu P.S.(2003). A framework for clustering evolving data streams, Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003,pp.81-92
3. Bu J., Shen X., Xu B., Chen C., He X., Cai D.(2016). Improving Collaborative Recommendation via User-Item Subgroups, IEEE Transactions on Knowledge and Data Engineering,28,9,pp.2363-2375
4. Frey B.J., Dueck D.(2007). Clustering by passing messages between data points,Science,315,5814,pp.972-976

延伸閱讀