TY - JOUR
T1 - Next point-of-interest recommendation via a category-aware Listwise Bayesian Personalized Ranking
AU - He, Jing
AU - Li, Xin
AU - Liao, Lejian
N1 - Publisher Copyright:
© 2017 Elsevier B.V.
PY - 2018/9
Y1 - 2018/9
N2 - In recent years, location-based social networks (LBSNs) have attracted much attention, and next point-of-interest (POI) recommendation has become an important task for LBSNs. However, previous efforts suffer from the high computational complexity, besides the transition pattern between POIs has not been well studied. In this paper, we proposed a two-fold approach for next POI recommendation. First, we predict the next category by using a third-rank tensor optimized by a Listwise Bayesian Personalized Ranking (LBPR) approach. Specifically, we introduce two functions, namely Plackett–Luce model and cross entropy, to generate the likelihood of a ranking list for posterior computation. The optimization criteria of LBPR are derived from a perspective of Bayesian analysis for ranking problems, and we formulate the listwise loss functions by two probability model. Then POI candidates filtered by the predicated category are ranked based on the spatial influence and category ranking influence. By explicit usage of category information to infer the user transition pattern in category-level, the proposed models are ideally better with the next new POI recommendation problem. The experiments on two real-world datasets demonstrate the significant improvements of our methods over several state-of-the-art methods.
AB - In recent years, location-based social networks (LBSNs) have attracted much attention, and next point-of-interest (POI) recommendation has become an important task for LBSNs. However, previous efforts suffer from the high computational complexity, besides the transition pattern between POIs has not been well studied. In this paper, we proposed a two-fold approach for next POI recommendation. First, we predict the next category by using a third-rank tensor optimized by a Listwise Bayesian Personalized Ranking (LBPR) approach. Specifically, we introduce two functions, namely Plackett–Luce model and cross entropy, to generate the likelihood of a ranking list for posterior computation. The optimization criteria of LBPR are derived from a perspective of Bayesian analysis for ranking problems, and we formulate the listwise loss functions by two probability model. Then POI candidates filtered by the predicated category are ranked based on the spatial influence and category ranking influence. By explicit usage of category information to infer the user transition pattern in category-level, the proposed models are ideally better with the next new POI recommendation problem. The experiments on two real-world datasets demonstrate the significant improvements of our methods over several state-of-the-art methods.
KW - Learning to rank
KW - Point-of-interest
KW - Recommendation
UR - http://www.scopus.com/inward/record.url?scp=85031408813&partnerID=8YFLogxK
U2 - 10.1016/j.jocs.2017.09.014
DO - 10.1016/j.jocs.2017.09.014
M3 - Article
AN - SCOPUS:85031408813
SN - 1877-7503
VL - 28
SP - 206
EP - 216
JO - Journal of Computational Science
JF - Journal of Computational Science
ER -