完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLiu, Duen-Renen_US
dc.contributor.authorChen, Kuan-Yuen_US
dc.contributor.authorChou, Yun-Chengen_US
dc.contributor.authorLee, Jia-Hueien_US
dc.date.accessioned2019-04-02T05:58:09Z-
dc.date.available2019-04-02T05:58:09Z-
dc.date.issued2018-12-01en_US
dc.identifier.issn0950-7051en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.knosys.2018.07.038en_US
dc.identifier.urihttp://hdl.handle.net/11536/148576-
dc.description.abstractThe flourishing of the Internet has increasingly promoted the rise of new types of online news websites with e-commerce portals. Online news websites provide specific information on such topics as lifestyle, fashion news, and a variety of other activities. The provision of online recommendation of activities associated with online news websites has the potential to attract more users and create more benefits. Such online recommendations represent an important online trend. Furthermore, dynamically adjusting recommendation lists to increase users' click-through rates is important for limited online recommendation layouts; however, existing studies have not addressed this online recommendation issue. This research proposes a novel approach for the dynamic adjustment of recommendation lists to tackle the issue of limited recommendation layouts, and then develops novel online recommendation methods. This research designs novel methods based on non-negative matrix factorization (NMF) and latent Dirichlet allocation (LDA) to predict user preferences for activities, using analysis of browsing news and attending activities. We propose a novel online activity recommendation approach, taking into consideration the interest scores and push scores, for dynamically adjusting the recommendation list. The Most Frequently Pushed (MFP) strategy gives priority to replacing the most frequently pushed activity, while the Not Frequently Clicked (NFC) strategy gives priority to replacing the not frequently clicked activity. We implement our proposed approach on an online news website and evaluate its online recommendation performance. The results of our experiment demonstrate that our proposed approach can enhance the effectiveness of recommendations. (C) 2018 Elsevier B.V. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectRecommender systemen_US
dc.subjectOnline recommendationen_US
dc.subjectLatent topic modelen_US
dc.subjectMatrix factorizationen_US
dc.subjectDynamic adjustment of recommendation listen_US
dc.titleOnline recommendations based on dynamic adjustment of recommendation listsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.knosys.2018.07.038en_US
dc.identifier.journalKNOWLEDGE-BASED SYSTEMSen_US
dc.citation.volume161en_US
dc.citation.spage375en_US
dc.citation.epage389en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000452575500026en_US
dc.citation.woscount0en_US
顯示於類別:期刊論文