Co-learning Multiple Browsing Tendencies of a User by Matrix Factorization-based Multitask Learning

Guo-Jhen Bai, Cheng-You Lien, Hung-Hsuan Chen
{"title":"Co-learning Multiple Browsing Tendencies of a User by Matrix Factorization-based Multitask Learning","authors":"Guo-Jhen Bai, Cheng-You Lien, Hung-Hsuan Chen","doi":"10.1145/3350546.3352526","DOIUrl":null,"url":null,"abstract":"Predicting an online user’s future behavior is beneficial for many applications. For example, online retailers may utilize such information to customize the marketing strategy and maximize profit. This paper aims to predict the types of webpages a user is going to click on. We observe that instead of building independent models to predict each individual type of web page, it is more effective to use a unified model to predict a user’s future clicks on different types of web pages simultaneously. The proposed model makes predictions based on the latent variables that represent possible interactions among the multiple targets and among the features. The experimental results show that this method outperforms the carefully tuned single-target training models most of the time. If the size of the training data is limited, the model shows a significant improvement over the baseline models, likely because the hidden relationship among different targets can be discovered by our model.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3350546.3352526","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Predicting an online user’s future behavior is beneficial for many applications. For example, online retailers may utilize such information to customize the marketing strategy and maximize profit. This paper aims to predict the types of webpages a user is going to click on. We observe that instead of building independent models to predict each individual type of web page, it is more effective to use a unified model to predict a user’s future clicks on different types of web pages simultaneously. The proposed model makes predictions based on the latent variables that represent possible interactions among the multiple targets and among the features. The experimental results show that this method outperforms the carefully tuned single-target training models most of the time. If the size of the training data is limited, the model shows a significant improvement over the baseline models, likely because the hidden relationship among different targets can be discovered by our model.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于矩阵分解的多任务学习共同学习用户的多种浏览倾向
预测在线用户的未来行为对许多应用程序都是有益的。例如,在线零售商可以利用这些信息来定制营销策略,实现利润最大化。本文旨在预测用户将点击的网页类型。我们观察到,与其建立独立的模型来预测每个单独类型的网页,不如使用统一的模型来同时预测用户在不同类型网页上的未来点击量。该模型基于代表多个目标之间和特征之间可能相互作用的潜在变量进行预测。实验结果表明,该方法在大多数情况下优于精心调整的单目标训练模型。如果训练数据的大小是有限的,则模型比基线模型有显著的改进,这可能是因为我们的模型可以发现不同目标之间的隐藏关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Issue Recommendation for Open Source Communities Exploring Differences in the Impact of Users’ Traces on Arabic and English Facebook Search Design and implementation of an open source Greek POS Tagger and Entity Recognizer using spaCy Extracting Ego-Centric Social Networks from Linked Open Data Towards an End-User Layer for Data Integrity
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1