Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation

Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we obser...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dang, Yizhou, Yang, Enneng, Guo, Guibing, Jiang, Linying, Wang, Xingwei, Xu, Xiaoxiao, Sun, Qinghui, Liu, Hong
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Dang, Yizhou
Yang, Enneng
Guo, Guibing
Jiang, Linying
Wang, Xingwei
Xu, Xiaoxiao
Sun, Qinghui
Liu, Hong
description Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we observe that the time interval in a sequence may vary significantly different, and thus result in the ineffectiveness of user modeling due to the issue of \emph{preference drift}. In fact, we conducted an empirical study to validate this observation, and found that a sequence with uniformly distributed time interval (denoted as uniform sequence) is more beneficial for performance improvement than that with greatly varying time interval. Therefore, we propose to augment sequence data from the perspective of time interval, which is not studied in the literature. Specifically, we design five operators (Ti-Crop, Ti-Reorder, Ti-Mask, Ti-Substitute, Ti-Insert) to transform the original non-uniform sequence to uniform sequence with the consideration of variance of time intervals. Then, we devise a control strategy to execute data augmentation on item sequences in different lengths. Finally, we implement these improvements on a state-of-the-art model CoSeRec and validate our approach on four real datasets. The experimental results show that our approach reaches significantly better performance than the other 11 competing methods. Our implementation is available: https://github.com/KingGugu/TiCoSeRec.
doi_str_mv 10.48550/arxiv.2212.08262
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2212_08262</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2212_08262</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-103ba9ba81681b3a7c4d1e8437646a62a1e6f7dfbd519cf077f1b674b83d2c8e3</originalsourceid><addsrcrecordid>eNotj8tKxDAYhbNxIaMP4Mq8QGtzaZJxV8fbwICgdSeUP8kfCUxbjZlR395OndU5cC7wEXLBqlKauq6uIP3Efck542VluOKn5O11iGFMPX3Bzx0ODukN5ozpmraxR7oeJr-HLW2-ISG9hQy02b33OGTIcRzotD1Oc5xqz-jGfkr9nJ6RkwDbLzw_6oK093ft6rHYPD2sV82mAKV5wSphYWnBMGWYFaCd9AyNFFpJBYoDQxW0D9bXbOlCpXVgVmlpjfDcGRQLcvl_O-N1Hyn2kH67A2Y3Y4o_cspOQA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation</title><source>arXiv.org</source><creator>Dang, Yizhou ; Yang, Enneng ; Guo, Guibing ; Jiang, Linying ; Wang, Xingwei ; Xu, Xiaoxiao ; Sun, Qinghui ; Liu, Hong</creator><creatorcontrib>Dang, Yizhou ; Yang, Enneng ; Guo, Guibing ; Jiang, Linying ; Wang, Xingwei ; Xu, Xiaoxiao ; Sun, Qinghui ; Liu, Hong</creatorcontrib><description>Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we observe that the time interval in a sequence may vary significantly different, and thus result in the ineffectiveness of user modeling due to the issue of \emph{preference drift}. In fact, we conducted an empirical study to validate this observation, and found that a sequence with uniformly distributed time interval (denoted as uniform sequence) is more beneficial for performance improvement than that with greatly varying time interval. Therefore, we propose to augment sequence data from the perspective of time interval, which is not studied in the literature. Specifically, we design five operators (Ti-Crop, Ti-Reorder, Ti-Mask, Ti-Substitute, Ti-Insert) to transform the original non-uniform sequence to uniform sequence with the consideration of variance of time intervals. Then, we devise a control strategy to execute data augmentation on item sequences in different lengths. Finally, we implement these improvements on a state-of-the-art model CoSeRec and validate our approach on four real datasets. The experimental results show that our approach reaches significantly better performance than the other 11 competing methods. Our implementation is available: https://github.com/KingGugu/TiCoSeRec.</description><identifier>DOI: 10.48550/arxiv.2212.08262</identifier><language>eng</language><subject>Computer Science - Information Retrieval ; Computer Science - Learning</subject><creationdate>2022-12</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,781,886</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2212.08262$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2212.08262$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Dang, Yizhou</creatorcontrib><creatorcontrib>Yang, Enneng</creatorcontrib><creatorcontrib>Guo, Guibing</creatorcontrib><creatorcontrib>Jiang, Linying</creatorcontrib><creatorcontrib>Wang, Xingwei</creatorcontrib><creatorcontrib>Xu, Xiaoxiao</creatorcontrib><creatorcontrib>Sun, Qinghui</creatorcontrib><creatorcontrib>Liu, Hong</creatorcontrib><title>Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation</title><description>Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we observe that the time interval in a sequence may vary significantly different, and thus result in the ineffectiveness of user modeling due to the issue of \emph{preference drift}. In fact, we conducted an empirical study to validate this observation, and found that a sequence with uniformly distributed time interval (denoted as uniform sequence) is more beneficial for performance improvement than that with greatly varying time interval. Therefore, we propose to augment sequence data from the perspective of time interval, which is not studied in the literature. Specifically, we design five operators (Ti-Crop, Ti-Reorder, Ti-Mask, Ti-Substitute, Ti-Insert) to transform the original non-uniform sequence to uniform sequence with the consideration of variance of time intervals. Then, we devise a control strategy to execute data augmentation on item sequences in different lengths. Finally, we implement these improvements on a state-of-the-art model CoSeRec and validate our approach on four real datasets. The experimental results show that our approach reaches significantly better performance than the other 11 competing methods. Our implementation is available: https://github.com/KingGugu/TiCoSeRec.</description><subject>Computer Science - Information Retrieval</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tKxDAYhbNxIaMP4Mq8QGtzaZJxV8fbwICgdSeUP8kfCUxbjZlR395OndU5cC7wEXLBqlKauq6uIP3Efck542VluOKn5O11iGFMPX3Bzx0ODukN5ozpmraxR7oeJr-HLW2-ISG9hQy02b33OGTIcRzotD1Oc5xqz-jGfkr9nJ6RkwDbLzw_6oK093ft6rHYPD2sV82mAKV5wSphYWnBMGWYFaCd9AyNFFpJBYoDQxW0D9bXbOlCpXVgVmlpjfDcGRQLcvl_O-N1Hyn2kH67A2Y3Y4o_cspOQA</recordid><startdate>20221215</startdate><enddate>20221215</enddate><creator>Dang, Yizhou</creator><creator>Yang, Enneng</creator><creator>Guo, Guibing</creator><creator>Jiang, Linying</creator><creator>Wang, Xingwei</creator><creator>Xu, Xiaoxiao</creator><creator>Sun, Qinghui</creator><creator>Liu, Hong</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20221215</creationdate><title>Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation</title><author>Dang, Yizhou ; Yang, Enneng ; Guo, Guibing ; Jiang, Linying ; Wang, Xingwei ; Xu, Xiaoxiao ; Sun, Qinghui ; Liu, Hong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-103ba9ba81681b3a7c4d1e8437646a62a1e6f7dfbd519cf077f1b674b83d2c8e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Information Retrieval</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Dang, Yizhou</creatorcontrib><creatorcontrib>Yang, Enneng</creatorcontrib><creatorcontrib>Guo, Guibing</creatorcontrib><creatorcontrib>Jiang, Linying</creatorcontrib><creatorcontrib>Wang, Xingwei</creatorcontrib><creatorcontrib>Xu, Xiaoxiao</creatorcontrib><creatorcontrib>Sun, Qinghui</creatorcontrib><creatorcontrib>Liu, Hong</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dang, Yizhou</au><au>Yang, Enneng</au><au>Guo, Guibing</au><au>Jiang, Linying</au><au>Wang, Xingwei</au><au>Xu, Xiaoxiao</au><au>Sun, Qinghui</au><au>Liu, Hong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation</atitle><date>2022-12-15</date><risdate>2022</risdate><abstract>Sequential recommendation is an important task to predict the next-item to access based on a sequence of interacted items. Most existing works learn user preference as the transition pattern from the previous item to the next one, ignoring the time interval between these two items. However, we observe that the time interval in a sequence may vary significantly different, and thus result in the ineffectiveness of user modeling due to the issue of \emph{preference drift}. In fact, we conducted an empirical study to validate this observation, and found that a sequence with uniformly distributed time interval (denoted as uniform sequence) is more beneficial for performance improvement than that with greatly varying time interval. Therefore, we propose to augment sequence data from the perspective of time interval, which is not studied in the literature. Specifically, we design five operators (Ti-Crop, Ti-Reorder, Ti-Mask, Ti-Substitute, Ti-Insert) to transform the original non-uniform sequence to uniform sequence with the consideration of variance of time intervals. Then, we devise a control strategy to execute data augmentation on item sequences in different lengths. Finally, we implement these improvements on a state-of-the-art model CoSeRec and validate our approach on four real datasets. The experimental results show that our approach reaches significantly better performance than the other 11 competing methods. Our implementation is available: https://github.com/KingGugu/TiCoSeRec.</abstract><doi>10.48550/arxiv.2212.08262</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2212.08262
ispartof
issn
language eng
recordid cdi_arxiv_primary_2212_08262
source arXiv.org
subjects Computer Science - Information Retrieval
Computer Science - Learning
title Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-16T14%3A08%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Uniform%20Sequence%20Better:%20Time%20Interval%20Aware%20Data%20Augmentation%20for%20Sequential%20Recommendation&rft.au=Dang,%20Yizhou&rft.date=2022-12-15&rft_id=info:doi/10.48550/arxiv.2212.08262&rft_dat=%3Carxiv_GOX%3E2212_08262%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true