A Category-Aware Deep Model for Successive POI Recommendation on Sparse Check-in Data

112Citations
Citations of this article
65Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As considerable amounts of POI check-in data have been accumulated, successive point-of-interest (POI) recommendation is increasingly popular. Existing successive POI recommendation methods only predict where user will go next, ignoring when this behavior will occur. In this work, we focus on predicting POIs that will be visited by users in the next 24 hours. As check-in data is very sparse, it is challenging to accurately capture user preferences in temporal patterns. To this end, we propose a category-aware deep model CatDM that incorporates POI category and geographical influence to reduce search space to overcome data sparsity. We design two deep encoders based on LSTM to model the time series data. The first encoder captures user preferences in POI categories, whereas the second exploits user preferences in POIs. Considering clock influence in the second encoder, we divide each user's check-in history into several different time windows and develop a personalized attention mechanism for each window to facilitate CatDM to exploit temporal patterns. Moreover, to sort the candidate set, we consider four specific dependencies: user-POI, user-category, POI-time and POI-user current preferences. Extensive experiments are conducted on two large real datasets. The experimental results demonstrate that our CatDM outperforms the state-of-the-art models for successive POI recommendation on sparse check-in data.

Cite

CITATION STYLE

APA

Yu, F., Cui, L., Guo, W., Lu, X., Li, Q., & Lu, H. (2020). A Category-Aware Deep Model for Successive POI Recommendation on Sparse Check-in Data. In The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020 (pp. 1264–1274). Association for Computing Machinery, Inc. https://doi.org/10.1145/3366423.3380202

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free