paper-with-me

홈 › Papers

Time Interval-enhanced Graph Neural Network for Shared-account Cross-domain Sequential Recommendation

2022-06-16 · Lei Guo, Jinyu Zhang, Li Tang, Tong Chen, Lei Zhu, Hongzhi Yin

Shared-account Cross-domain Sequential Recommendation (SCSR) task aims to recommend the next item via leveraging the mixed user behaviors in multiple domains. It is gaining immense research attention as more and more users tend to sign up on different platforms and share accounts with others to access domain-specific services. Existing works on SCSR mainly rely on mining sequential patterns via Recurrent Neural Network (RNN)-based models, which suffer from the following limitations: 1) RNN-based methods overwhelmingly target discovering sequential dependencies in single-user behaviors. They are not expressive enough to capture the relationships among multiple entities in SCSR. 2) All existing methods bridge two domains via knowledge transfer in the latent space, and ignore the explicit cross-domain graph structure. 3) None existing studies consider the time interval information among items, which is essential in the sequential recommendation for characterizing different items and learning discriminative representations for them. In this work, we propose a new graph-based solution, namely TiDA-GCN, to address the above challenges. Specifically, we first link users and items in each domain as a graph. Then, we devise a domain-aware graph convolution network to learn userspecific node representations. To fully account for users' domainspecific preferences on items, two effective attention mechanisms are further developed to selectively guide the message passing process. Moreover, to further enhance item- and account-level representation learning, we incorporate the time interval into the message passing, and design an account-aware self-attention module for learning items' interactive characteristics. Experiments demonstrate the superiority of our proposed method from various aspects.

📄 PDF Abstract BibTeX arXiv:2206.08050

Code (1)

JinyuZ1996/TiDA-GCN 공식 구현 tf

Tasks

Graph Neural NetworkRepresentation LearningSequential RecommendationTransfer Learning

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Leveraging Pre-trained Language Models for Time Interval Prediction in Text-Enhanced Temporal Knowledge Graphs

2023-09-28 · Duygu Sezen Islakoglu, Mel Chekol, Yannis Velegrakis

Most knowledge graph completion (KGC) methods learn latent representations of entities and relations of a given graph by mapping them into a vector space. Although the majority of these methods focus on static knowledge …

Knowledge Graph CompletionKnowledge GraphsLink PredictionRepresentation Learning+3

Reinforcement Learning-enhanced Shared-account Cross-domain Sequential Recommendation

2022-06-16 · Lei Guo, Jinyu Zhang, Tong Chen, Xinhua Wang 외

Shared-account Cross-domain Sequential Recommendation (SCSR) is an emerging yet challenging task that simultaneously considers the shared-account and cross-domain characteristics in the sequential recommendation. Existin…

Graph Neural NetworkHierarchical Reinforcement Learningreinforcement-learningReinforcement Learning+3

SemEval 2018 Task 6: Parsing Time Normalizations

2018-06-01 · SEMEVAL 2018 6 · Egoitz Laparra, Dongfang Xu, Ahmed Elsayed, Steven Bethard 외

This paper presents the outcomes of the Parsing Time Normalization shared task held within SemEval-2018. The aim of the task is to parse time expressions into the compositional semantic graphs of the Semantically Composi…

Semantic Parsing

Multi-Agent Pathfinding with Non-Unit Integer Edge Costs via Enhanced Conflict-Based Search and Graph Discretization

2026-04-07 · Hongkai Fan, Qinjing Xie, Bo Ouyang, Yaonan Wang 외 arxiv

Multi-Agent Pathfinding (MAPF) plays a critical role in various domains. Traditional MAPF methods typically assume unit edge costs and single-timestep actions, which limit their applicability to real-world scenarios. MAP…

Turku Enhanced Parser Pipeline: From Raw Text to Enhanced Graphs in the IWPT 2020 Shared Task

2020-07-01 · WS 2020 7 · Jenna Kanerva, Filip Ginter, Sampo Pyysalo

We present the approach of the TurkuNLP group to the IWPT 2020 shared task on Multilingual Parsing into Enhanced Universal Dependencies. The task involves 28 treebanks in 17 different languages and requires parsers to ge…

Lemmatization