以会议为中心的建议,利用社交媒体的未来背景

IF 0.8 4区 数学 Q2 MATHEMATICS
Sanjeev Dhawan, Kulvinder Singh, A. Rabaea, Amit Batra
{"title":"以会议为中心的建议,利用社交媒体的未来背景","authors":"Sanjeev Dhawan, Kulvinder Singh, A. Rabaea, Amit Batra","doi":"10.2478/auom-2021-0036","DOIUrl":null,"url":null,"abstract":"Abstract Session centered recommender systems has emerged as an interesting and challenging topic amid researchers during the past few years. In order to make a prediction in the sequential data, prevailing approaches utilize either left to right design autoregressive or data augmentation methods. As these approaches are used to utilize the sequential information pertaining to user conduct, the information about the future context of an objective interaction is totally ignored while making prediction. As a matter of fact, we claim that during the course of training, the future data after the objective interaction are present and this supplies indispensable signal on preferences of users and if utilized can increase the quality of recommendation. It is a subtle task to incorporate future contexts into the process of training, as the rules of machine learning are not followed and can result in loss of data. Therefore, in order to solve this problem, we suggest a novel encoder decoder prototype termed as space filling centered Recommender (SRec), which is used to train the encoder and decoder utilizing space filling approach. Particularly, an incomplete sequence is taken into consideration by the encoder as input (few items are absent) and then decoder is used to predict these items which are absent initially based on the encoded interpretation. The general SRec prototype is instantiated by us employing convolutional neural network (CNN) by giving emphasis on both e ciency and accuracy. The empirical studies and investigation on two real world datasets are conducted by us including short, medium and long sequences, which exhibits that SRec performs better than traditional sequential recommendation approaches.","PeriodicalId":55522,"journal":{"name":"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Session centered Recommendation Utilizing Future Contexts in Social Media\",\"authors\":\"Sanjeev Dhawan, Kulvinder Singh, A. Rabaea, Amit Batra\",\"doi\":\"10.2478/auom-2021-0036\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract Session centered recommender systems has emerged as an interesting and challenging topic amid researchers during the past few years. In order to make a prediction in the sequential data, prevailing approaches utilize either left to right design autoregressive or data augmentation methods. As these approaches are used to utilize the sequential information pertaining to user conduct, the information about the future context of an objective interaction is totally ignored while making prediction. As a matter of fact, we claim that during the course of training, the future data after the objective interaction are present and this supplies indispensable signal on preferences of users and if utilized can increase the quality of recommendation. It is a subtle task to incorporate future contexts into the process of training, as the rules of machine learning are not followed and can result in loss of data. Therefore, in order to solve this problem, we suggest a novel encoder decoder prototype termed as space filling centered Recommender (SRec), which is used to train the encoder and decoder utilizing space filling approach. Particularly, an incomplete sequence is taken into consideration by the encoder as input (few items are absent) and then decoder is used to predict these items which are absent initially based on the encoded interpretation. The general SRec prototype is instantiated by us employing convolutional neural network (CNN) by giving emphasis on both e ciency and accuracy. The empirical studies and investigation on two real world datasets are conducted by us including short, medium and long sequences, which exhibits that SRec performs better than traditional sequential recommendation approaches.\",\"PeriodicalId\":55522,\"journal\":{\"name\":\"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2021-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2478/auom-2021-0036\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Analele Stiintifice Ale Universitatii Ovidius Constanta-Seria Matematica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2478/auom-2021-0036","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

摘要

在过去的几年里,以会话为中心的推荐系统已经成为一个有趣而富有挑战性的话题。为了在序列数据中进行预测,常用的方法是利用从左到右设计自回归或数据增强方法。由于这些方法用于利用与用户行为有关的顺序信息,因此在进行预测时,关于客观交互的未来上下文的信息完全被忽略了。事实上,我们认为,在训练过程中,客观交互后的未来数据是存在的,这为用户的偏好提供了不可或缺的信号,如果加以利用,可以提高推荐的质量。将未来的背景纳入训练过程是一项微妙的任务,因为不遵守机器学习规则可能导致数据丢失。因此,为了解决这一问题,我们提出了一种新的编码器解码器原型,称为以空间填充为中心的推荐器(SRec),用于利用空间填充方法训练编码器和解码器。特别地,编码器将不完整序列作为输入(很少项目缺失),然后使用解码器根据编码解释预测这些最初缺失的项目。我们采用卷积神经网络(CNN)实例化了通用的SRec原型,同时强调了效率和准确性。我们对两个真实世界的数据集(包括短、中、长序列)进行了实证研究和调查,结果表明SRec比传统的序列推荐方法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Session centered Recommendation Utilizing Future Contexts in Social Media
Abstract Session centered recommender systems has emerged as an interesting and challenging topic amid researchers during the past few years. In order to make a prediction in the sequential data, prevailing approaches utilize either left to right design autoregressive or data augmentation methods. As these approaches are used to utilize the sequential information pertaining to user conduct, the information about the future context of an objective interaction is totally ignored while making prediction. As a matter of fact, we claim that during the course of training, the future data after the objective interaction are present and this supplies indispensable signal on preferences of users and if utilized can increase the quality of recommendation. It is a subtle task to incorporate future contexts into the process of training, as the rules of machine learning are not followed and can result in loss of data. Therefore, in order to solve this problem, we suggest a novel encoder decoder prototype termed as space filling centered Recommender (SRec), which is used to train the encoder and decoder utilizing space filling approach. Particularly, an incomplete sequence is taken into consideration by the encoder as input (few items are absent) and then decoder is used to predict these items which are absent initially based on the encoded interpretation. The general SRec prototype is instantiated by us employing convolutional neural network (CNN) by giving emphasis on both e ciency and accuracy. The empirical studies and investigation on two real world datasets are conducted by us including short, medium and long sequences, which exhibits that SRec performs better than traditional sequential recommendation approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.30
自引率
0.00%
发文量
15
审稿时长
6-12 weeks
期刊介绍: This journal is founded by Mirela Stefanescu and Silviu Sburlan in 1993 and is devoted to pure and applied mathematics. Published by Faculty of Mathematics and Computer Science, Ovidius University, Constanta, Romania.
×
引用
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学术官方微信