Heterogeneous Spatio-Temporal Graph Contrastive Learning for Point-of-Interest Recommendation

IF 6.6 1区 计算机科学 Q1 Multidisciplinary Tsinghua Science and Technology Pub Date : 2024-09-11 DOI:10.26599/TST.2023.9010148
Jiawei Liu;Haihan Gao;Cheng Yang;Chuan Shi;Tianchi Yang;Hongtao Cheng;Qianlong Xie;Xingxing Wang;Dong Wang
{"title":"Heterogeneous Spatio-Temporal Graph Contrastive Learning for Point-of-Interest Recommendation","authors":"Jiawei Liu;Haihan Gao;Cheng Yang;Chuan Shi;Tianchi Yang;Hongtao Cheng;Qianlong Xie;Xingxing Wang;Dong Wang","doi":"10.26599/TST.2023.9010148","DOIUrl":null,"url":null,"abstract":"As one of the most crucial topics in the recommendation system field, point-of-interest (POI) recommendation aims to recommending potential interesting POIs to users. Recently, graph neural networks (GNNs) have been successfully used to model interaction and spatio-temporal information in POI recommendations, but the data sparsity of POI recommendations affects the training of GNNs. Although some existing GNN-based POI recommendation approaches try to use social relationships or user attributes to alleviate the data sparsity problem, such auxiliary information is not always available for privacy reasons. Self-supervised learning gives a new idea to alleviate the data sparsity problem, but most existing self-supervised recommendation methods cannot be directly used in the spatio-temporal graph of POI recommendations. In this paper, we propose a novel heterogeneous spatio-temporal graph contrastive learning method, HestGCL, to compensate for existing GNN-based methods' shortcomings. To model spatio-temporal information, we generate spatio-temporally specific views and design view-specific heterogeneous graph neural networks to model spatial and temporal information, respectively. To alleviate data sparsity, we propose a cross-view contrastive strategy to capture differences and correlations among views, providing more supervision signals and boosting the overall performance collaboratively. Extensive experiments on three benchmark datasets demonstrate the effectiveness of HestGCL, which significantly outperforms existing methods.","PeriodicalId":48690,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":6.6000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10676346","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10676346/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Multidisciplinary","Score":null,"Total":0}
引用次数: 0

Abstract

As one of the most crucial topics in the recommendation system field, point-of-interest (POI) recommendation aims to recommending potential interesting POIs to users. Recently, graph neural networks (GNNs) have been successfully used to model interaction and spatio-temporal information in POI recommendations, but the data sparsity of POI recommendations affects the training of GNNs. Although some existing GNN-based POI recommendation approaches try to use social relationships or user attributes to alleviate the data sparsity problem, such auxiliary information is not always available for privacy reasons. Self-supervised learning gives a new idea to alleviate the data sparsity problem, but most existing self-supervised recommendation methods cannot be directly used in the spatio-temporal graph of POI recommendations. In this paper, we propose a novel heterogeneous spatio-temporal graph contrastive learning method, HestGCL, to compensate for existing GNN-based methods' shortcomings. To model spatio-temporal information, we generate spatio-temporally specific views and design view-specific heterogeneous graph neural networks to model spatial and temporal information, respectively. To alleviate data sparsity, we propose a cross-view contrastive strategy to capture differences and correlations among views, providing more supervision signals and boosting the overall performance collaboratively. Extensive experiments on three benchmark datasets demonstrate the effectiveness of HestGCL, which significantly outperforms existing methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于兴趣点推荐的异构时空图对比学习
作为推荐系统领域最重要的课题之一,兴趣点(POI)推荐旨在向用户推荐潜在的感兴趣的兴趣点。最近,图神经网络(GNN)被成功地用于对兴趣点推荐中的交互和时空信息进行建模,但兴趣点推荐的数据稀疏性影响了 GNN 的训练。虽然现有的一些基于 GNN 的 POI 推荐方法试图利用社会关系或用户属性来缓解数据稀疏问题,但出于隐私原因,这些辅助信息并不总是可用的。自监督学习为缓解数据稀疏问题提供了一种新思路,但现有的大多数自监督推荐方法无法直接用于 POI 推荐的时空图。本文提出了一种新型异构时空图对比学习方法 HestGCL,以弥补现有基于 GNN 方法的不足。为了对时空信息建模,我们生成了特定时空的视图,并设计了特定视图的异构图神经网络,分别对空间信息和时间信息建模。为了缓解数据稀缺问题,我们提出了跨视图对比策略,以捕捉视图之间的差异和相关性,从而提供更多的监督信号,协同提升整体性能。在三个基准数据集上的广泛实验证明了 HestGCL 的有效性,其性能明显优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Tsinghua Science and Technology
Tsinghua Science and Technology COMPUTER SCIENCE, INFORMATION SYSTEMSCOMPU-COMPUTER SCIENCE, SOFTWARE ENGINEERING
CiteScore
10.20
自引率
10.60%
发文量
2340
期刊介绍: Tsinghua Science and Technology (Tsinghua Sci Technol) started publication in 1996. It is an international academic journal sponsored by Tsinghua University and is published bimonthly. This journal aims at presenting the up-to-date scientific achievements in computer science, electronic engineering, and other IT fields. Contributions all over the world are welcome.
期刊最新文献
Contents Front Cover LP-Rounding Based Algorithm for Capacitated Uniform Facility Location Problem with Soft Penalties A P4-Based Approach to Traffic Isolation and Bandwidth Management for 5G Network Slicing Quantum-Inspired Sensitive Data Measurement and Secure Transmission in 5G-Enabled Healthcare Systems
×
引用
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