使用XGBoost学习排序方法预测用户偏好

N. N. Qomariyah, D. Kazakov, A. Fajar
{"title":"使用XGBoost学习排序方法预测用户偏好","authors":"N. N. Qomariyah, D. Kazakov, A. Fajar","doi":"10.1109/ISRITI51436.2020.9315494","DOIUrl":null,"url":null,"abstract":"Learning user preferences become very important as the personalization systems grow rapidly in this current era. Offering special and personal services can be an added value for the companies to maintain their customer loyalty. Building a personalized recommendation requires a good machine learning model to understand the individual preferences. Every user can be presented with a list of items sorted by its score learned from the individual preferences. So the first couple items shown will be the most liked items by the user. We can borrow the Learning to Rank algorithm from Information Retrieval to solve this problem. In this paper, we present the implementation of user preferences learning by using XGBoost Learning to Rank method in movie domain. We show the evaluation of three different approaches in Learning to Rank according to their Normalized Discounted Cumulative Gain (NDCG) score. We can conclude that in our case study, the pairwise approach appears to be the best solution to produce a personalized list of recommendation.","PeriodicalId":325920,"journal":{"name":"2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Predicting User Preferences with XGBoost Learning to Rank Method\",\"authors\":\"N. N. Qomariyah, D. Kazakov, A. Fajar\",\"doi\":\"10.1109/ISRITI51436.2020.9315494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Learning user preferences become very important as the personalization systems grow rapidly in this current era. Offering special and personal services can be an added value for the companies to maintain their customer loyalty. Building a personalized recommendation requires a good machine learning model to understand the individual preferences. Every user can be presented with a list of items sorted by its score learned from the individual preferences. So the first couple items shown will be the most liked items by the user. We can borrow the Learning to Rank algorithm from Information Retrieval to solve this problem. In this paper, we present the implementation of user preferences learning by using XGBoost Learning to Rank method in movie domain. We show the evaluation of three different approaches in Learning to Rank according to their Normalized Discounted Cumulative Gain (NDCG) score. We can conclude that in our case study, the pairwise approach appears to be the best solution to produce a personalized list of recommendation.\",\"PeriodicalId\":325920,\"journal\":{\"name\":\"2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISRITI51436.2020.9315494\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISRITI51436.2020.9315494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

随着个性化系统在当今时代的快速发展,了解用户偏好变得非常重要。提供特殊和个性化的服务可以成为公司保持客户忠诚度的附加价值。构建个性化推荐需要一个好的机器学习模型来理解个人偏好。每个用户都可以看到一个项目列表,根据从个人偏好中获得的分数进行排序。因此,显示的前两个项目将是用户最喜欢的项目。我们可以借鉴信息检索中的排序学习算法来解决这个问题。在本文中,我们提出了使用XGBoost学习排序方法在电影领域中实现用户偏好学习。我们展示了根据归一化贴现累积增益(NDCG)分数对三种不同的学习排序方法的评估。我们可以得出结论,在我们的案例研究中,两两方法似乎是生成个性化推荐列表的最佳解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Predicting User Preferences with XGBoost Learning to Rank Method
Learning user preferences become very important as the personalization systems grow rapidly in this current era. Offering special and personal services can be an added value for the companies to maintain their customer loyalty. Building a personalized recommendation requires a good machine learning model to understand the individual preferences. Every user can be presented with a list of items sorted by its score learned from the individual preferences. So the first couple items shown will be the most liked items by the user. We can borrow the Learning to Rank algorithm from Information Retrieval to solve this problem. In this paper, we present the implementation of user preferences learning by using XGBoost Learning to Rank method in movie domain. We show the evaluation of three different approaches in Learning to Rank according to their Normalized Discounted Cumulative Gain (NDCG) score. We can conclude that in our case study, the pairwise approach appears to be the best solution to produce a personalized list of recommendation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信