paper-with-me

Papers

Kernel-based Substructure Exploration for Next POI Recommendation

2022-10-08 · Wei Ju, Yifang Qin, Ziyue Qiao, Xiao Luo, Yifan Wang, Yanjie Fu, Ming Zhang

Point-of-Interest (POI) recommendation, which benefits from the proliferation of GPS-enabled devices and location-based social networks (LBSNs), plays an increasingly important role in recommender systems. It aims to provide users with the convenience to discover their interested places to visit based on previous visits and current status. Most existing methods usually merely leverage recurrent neural networks (RNNs) to explore sequential influences for recommendation. Despite the effectiveness, these methods not only neglect topological geographical influences among POIs, but also fail to model high-order sequential substructures. To tackle the above issues, we propose a Kernel-Based Graph Neural Network (KBGNN) for next POI recommendation, which combines the characteristics of both geographical and sequential influences in a collaborative way. KBGNN consists of a geographical module and a sequential module. On the one hand, we construct a geographical graph and leverage a message passing neural network to capture the topological geographical influences. On the other hand, we explore high-order sequential substructures in the user-aware sequential graph using a graph kernel neural network to capture user preferences. Finally, a consistency learning framework is introduced to jointly incorporate geographical and sequential information extracted from two separate graphs. In this way, the two modules effectively exchange knowledge to mutually enhance each other. Extensive experiments conducted on two real-world LBSN datasets demonstrate the superior performance of our proposed method over the state-of-the-arts. Our codes are available at https://github.com/Fang6ang/KBGNN.

📄 PDF Abstract BibTeX arXiv:2210.03969

Code (1)

Fang6ang/KBGNN 공식 구현 pytorch

Tasks

Graph Neural NetworkRecommendation Systems

Methods 이 논문이 사용한 방법론

Graph Neural Network 설명 없음

Similar Papers 제목 키워드 기반

Extending local features with contextual information in graph kernels

2015-07-08 · Nicolò Navarin, Alessandro Sperduti, Riccardo Tesselli

Graph kernels are usually defined in terms of simpler kernels over local substructures of the original graphs. Different kernels consider different types of substructures. However, in some cases they have similar predict…

Graph Classification

Deep Hierarchical Graph Alignment Kernels

2024-05-09 · Shuhao Tang, Hao Tian, Xiaofeng Cao, Wei Ye

Typical R-convolution graph kernels invoke the kernel functions that decompose graphs into non-isomorphic substructures and compare them. However, overlooking implicit similarities and topological position information be…

Position

AKBR: Learning Adaptive Kernel-based Representations for Graph Classification

2024-03-24 · Feifei Qian, Lixin Cui, Ming Li, Yue Wang 외

In this paper, we propose a new model to learn Adaptive Kernel-based Representations (AKBR) for graph classification. Unlike state-of-the-art R-convolution graph kernels that are defined by merely counting any pair of is…

Graph ClassificationRepresentation Learning

Towards Subgraph Isomorphism Counting with Graph Kernels

2024-05-13 · Xin Liu, Weiqi Wang, Jiaxin Bai, Yangqiu Song

Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and …

Graph ClassificationRepresentation Learning

Theoretically Improving Graph Neural Networks via Anonymous Walk Graph Kernels

2021-04-07 · Qingqing Long, Yilun Jin, Yi Wu, Guojie Song

Graph neural networks (GNNs) have achieved tremendous success in graph mining. However, the inability of GNNs to model substructures in graphs remains a significant drawback. Specifically, message-passing GNNs (MPGNNs), …

Graph Mining