基于记忆模型的在线新闻服务日志用户兴趣挖掘

Wei Wang, Dongyan Zhao, Haining Luo, Xin Wang
{"title":"基于记忆模型的在线新闻服务日志用户兴趣挖掘","authors":"Wei Wang, Dongyan Zhao, Haining Luo, Xin Wang","doi":"10.1109/NAS.2013.25","DOIUrl":null,"url":null,"abstract":"User profiling plays an important role in online news recommendation systems. In this paper, we analyze the relationship between users' clicking behaviors and the category of the news story to model user's interests by mining web log data of an adaptive news system. We train a Memory-based User Profile (MUP), which imitates human being's learning, remembering and forgetting mechanisms, to predict users' potential interests dynamically. We mainly focus on experimental analysis to refine the MUP scheme. Firstly, we materialize the meanings of all parameters of MUP by important factors (i.e., absorbing factor, forgetting factor, timescale and learning strength) in human being's learning and forgetting process. Secondly, we demonstrate how to determine the values of parameters for different users to reflect their distinct learning and forgetting abilities. Thirdly, we derive a threshold from MUP's recursion formula, which can be used to simply distinguish long-term and short-term interests. Our evaluations are carried out on IdoIcan's web log data, results show MUP can model user's profile effectively.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"226 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Mining User Interests in Web Logs of an Online News Service Based on Memory Model\",\"authors\":\"Wei Wang, Dongyan Zhao, Haining Luo, Xin Wang\",\"doi\":\"10.1109/NAS.2013.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"User profiling plays an important role in online news recommendation systems. In this paper, we analyze the relationship between users' clicking behaviors and the category of the news story to model user's interests by mining web log data of an adaptive news system. We train a Memory-based User Profile (MUP), which imitates human being's learning, remembering and forgetting mechanisms, to predict users' potential interests dynamically. We mainly focus on experimental analysis to refine the MUP scheme. Firstly, we materialize the meanings of all parameters of MUP by important factors (i.e., absorbing factor, forgetting factor, timescale and learning strength) in human being's learning and forgetting process. Secondly, we demonstrate how to determine the values of parameters for different users to reflect their distinct learning and forgetting abilities. Thirdly, we derive a threshold from MUP's recursion formula, which can be used to simply distinguish long-term and short-term interests. Our evaluations are carried out on IdoIcan's web log data, results show MUP can model user's profile effectively.\",\"PeriodicalId\":213334,\"journal\":{\"name\":\"2013 IEEE Eighth International Conference on Networking, Architecture and Storage\",\"volume\":\"226 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Eighth International Conference on Networking, Architecture and Storage\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2013.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2013.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

用户特征分析在在线新闻推荐系统中起着重要的作用。本文通过挖掘自适应新闻系统的网络日志数据,分析用户点击行为与新闻类别之间的关系,建立用户兴趣模型。我们训练了一个基于记忆的用户模型(MUP),该模型模仿人类的学习、记忆和遗忘机制,动态预测用户的潜在兴趣。我们主要通过实验分析来完善MUP方案。首先,我们通过人类学习和遗忘过程中的重要因素(即吸收因素、遗忘因素、时间尺度和学习强度)来物化MUP各参数的含义。其次,我们演示了如何确定不同用户的参数值,以反映他们不同的学习和遗忘能力。第三,我们从MUP的递归公式中推导出一个阈值,可以简单地区分长期和短期利益。我们对IdoIcan的网络日志数据进行了评估,结果表明MUP可以有效地模拟用户的个人资料。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining User Interests in Web Logs of an Online News Service Based on Memory Model
User profiling plays an important role in online news recommendation systems. In this paper, we analyze the relationship between users' clicking behaviors and the category of the news story to model user's interests by mining web log data of an adaptive news system. We train a Memory-based User Profile (MUP), which imitates human being's learning, remembering and forgetting mechanisms, to predict users' potential interests dynamically. We mainly focus on experimental analysis to refine the MUP scheme. Firstly, we materialize the meanings of all parameters of MUP by important factors (i.e., absorbing factor, forgetting factor, timescale and learning strength) in human being's learning and forgetting process. Secondly, we demonstrate how to determine the values of parameters for different users to reflect their distinct learning and forgetting abilities. Thirdly, we derive a threshold from MUP's recursion formula, which can be used to simply distinguish long-term and short-term interests. Our evaluations are carried out on IdoIcan's web log data, results show MUP can model user's profile effectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信