Predicting user routines with masked dilated convolutions

Renzhong Wang, Dragomir Yankov, Michael R. Evans, S. Palanisamy, Siddharth Arora, Wei Wu
{"title":"Predicting user routines with masked dilated convolutions","authors":"Renzhong Wang, Dragomir Yankov, Michael R. Evans, S. Palanisamy, Siddharth Arora, Wei Wu","doi":"10.1145/3298689.3347025","DOIUrl":null,"url":null,"abstract":"Predicting users daily location visits - when and where they will go, and how long they will stay - is key for making effective location-based recommendations. Knowledge of an upcoming day allows the suggestion of relevant alternatives (e.g., a new coffee shop on the way to work) in advance, prior to a visit. This helps users make informed decisions and plan accordingly. People's visit routines, or just routines, can vary significantly from day to day, and visits from earlier in the day, week, or month may affect subsequent choices. Traditionally, routine prediction has been modeled with sequence methods, such as HMMs or more recently with RNN-based architectures. However, the problem with such architectures is that their predictive performance degrades when increasing the number of historical observations in the routine sequence. In this paper, we propose Masked-TCN (MTCN), a novel method based on time-dilated convolutional networks. The method implements custom dilations and masking which can process effectively long routine sequences, identifying recurring patterns at different resolution - hourly, daily, weekly, monthly. We demonstrate that MTCN achieves 8% improvement in accuracy over current state-of-the-art solutions on a large data set of visit routines.","PeriodicalId":215384,"journal":{"name":"Proceedings of the 13th ACM Conference on Recommender Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 13th ACM Conference on Recommender Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3298689.3347025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Predicting users daily location visits - when and where they will go, and how long they will stay - is key for making effective location-based recommendations. Knowledge of an upcoming day allows the suggestion of relevant alternatives (e.g., a new coffee shop on the way to work) in advance, prior to a visit. This helps users make informed decisions and plan accordingly. People's visit routines, or just routines, can vary significantly from day to day, and visits from earlier in the day, week, or month may affect subsequent choices. Traditionally, routine prediction has been modeled with sequence methods, such as HMMs or more recently with RNN-based architectures. However, the problem with such architectures is that their predictive performance degrades when increasing the number of historical observations in the routine sequence. In this paper, we propose Masked-TCN (MTCN), a novel method based on time-dilated convolutional networks. The method implements custom dilations and masking which can process effectively long routine sequences, identifying recurring patterns at different resolution - hourly, daily, weekly, monthly. We demonstrate that MTCN achieves 8% improvement in accuracy over current state-of-the-art solutions on a large data set of visit routines.
用掩模扩张卷积预测用户例程
预测用户每天的位置访问——何时何地,停留多长时间——是做出有效的基于位置的推荐的关键。对即将到来的一天的了解可以让你提前提出相关的建议(例如,上班路上的一家新咖啡店)。这有助于用户做出明智的决定和相应的计划。人们的访问惯例,或者仅仅是惯例,每天都有很大的不同,一天、一周或一个月早些时候的访问可能会影响后来的选择。传统上,常规预测是用序列方法建模的,比如hmm,或者最近用基于rnn的体系结构。然而,这种体系结构的问题是,当增加常规序列中的历史观察数量时,它们的预测性能会下降。本文提出了一种基于时间扩张卷积网络的新方法mask - tcn (MTCN)。该方法实现了自定义的膨胀和屏蔽,可以有效地处理长常规序列,以不同的分辨率(每小时、每天、每周、每月)识别重复模式。我们证明,在访问例程的大型数据集上,MTCN比当前最先进的解决方案的准确性提高了8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信