中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/93159
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41651598      Online Users : 1528
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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: http://ir.lib.ncu.edu.tw/handle/987654321/93159


    Title: NNI4Rec: Predicting Unknown Item with Neighborhood’s Next Item for Sequential-based Recommendation
    Authors: 曾雅君;Tseng, Ya-Chun
    Contributors: 資訊管理學系
    Keywords: 下一個項目推薦;項目嵌入;深度學習;全局資訊;神經網路;Next Item Recommendation;Item Embedding;Deep Learning;Global information;Neural Network
    Date: 2023-07-12
    Issue Date: 2024-09-19 16:44:53 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 在電子商務中,推薦系統所扮演的角色,其重要性不言而喻。然而,在傳統的基於Session或序列推薦模式中,通常使用先前的項目來推薦可能出現的下一個項目。這種方法面臨一個主要的挑戰,那就是人們傾向於重複購買。當用戶喜歡某項商品時,他們很可能再次選擇同樣的商品,這導致推薦系統多數推薦的項目其實已在之前的序列中出現過。
    然而,本論文認為一個準確、與吸引力兼具的推薦系統應該向用戶推薦他們還未發現但可能會喜歡的產品,一旦用戶知曉該產品,他們就有可能進行購買。因此,在預備資料時,本文會根據每個用戶的目標項目,將序列中先前出現過的目標項目全部刪除,確保用戶對該項目一無所知,而我們所提出的模型將在此情況下對目標項目進行預測。
    本文根據序列中相鄰項目的後續項目概念,設計了一個深度網路架構,此架構能夠整合局部與全局資訊,以實現成功預測目標項目的目標。我們已對多個真實世界資料集的實驗進行廣泛的測試,結果顯示本文提出的深度學習架構在性能上優於幾種最先進的推薦方法。
    ;In e-commerce, the importance of recommendation systems is increasing day by day. However, in traditional session-based or sequence-based recommendation modes, previous items are usually used to recommend the possible next item. This approach faces a significant challenge as people tend to repeat purchases. When users like a certain item, they are likely to choose the same item again, resulting in the majority of items recommended by the recommendation system having already appeared in previous sequences. However, this paper argues that an attractive recommendation system should recommend products to users that they don′t know but might like, and once they are aware of such products, they may choose to purchase them. Therefore, when preparing the data, this paper will delete all the target items that have previously appeared in the sequence based on each user′s target item, ensuring that users are unaware of the item. The model proposed in this paper will then predict the target item under this circumstance. This paper designs a deep network architecture based on the concept of the subsequent item of adjacent items in the sequence, incorporating both global and local information to achieve the goal of successfully predicting the target item. Through experiments with multiple real-world datasets, we conducted extensive testing, and the results show that the deep network architecture proposed in this paper outperforms several state-of-the-art recommendation methods in performance.
    Appears in Collections:[Graduate Institute of Information Management] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML12View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明