Time-slot-based point of interest recommendation on location-based social network

Author(s):  
Jun Zeng ◽  
Yinghua Li ◽  
Feng Li ◽  
Xin He ◽  
Junhao Wen
Author(s):  
Zih-Syuan Wang ◽  
◽  
Jing-Fu Juang ◽  
Wei-Guang Teng

A point of interest (POI) is a specific location that people may find useful or interesting, such as restaurants, stores, attractions, and hotels. With the recent proliferation of location-based social networks (LBSN), numerous users gather to interact and share information on various POIs. POI recommendations have become a crucial issue because it not only helps users to learn about new places but also gives LBSN providers chances to post POI advertisements. As we utilize a heterogeneous information network to represent an LBSN in this work, POI recommendations are remodeled as a link prediction problem, which is significant in the field of social network analysis. Moreover, we propose to utilize the meta-path-based approach to extract implicit but potentially useful relationships between a user and a POI. Then, the extracted topological features are used to construct a prediction model with appropriate data classification techniques. In our experiments, the Yelp dataset is utilized as our testbed for performance evaluation purposes. The results show that our prediction model is of good prediction quality in practical applications.


PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0255982
Author(s):  
Amr Elsisy ◽  
Boleslaw K. Szymanski ◽  
Jasmine A. Plum ◽  
Miao Qi ◽  
Alex Pentland

Milgram empirically showed that people knowing only connections to their friends could locate any person in the U.S. in a few steps. Later research showed that social network topology enables a node aware of its full routing to find an arbitrary target in even fewer steps. Yet, the success of people in forwarding efficiently knowing only personal connections is still not fully explained. To study this problem, we emulate it on a real location-based social network, Gowalla. It provides explicit information about friends and temporal locations of each user useful for studies of human mobility. Here, we use it to conduct a massive computational experiment to establish new necessary and sufficient conditions for achieving social search efficiency. The results demonstrate that only the distribution of friendship edges and the partial knowledge of friends of friends are essential and sufficient for the efficiency of social search. Surprisingly, the efficiency of the search using the original distribution of friendship edges is not dependent on how the nodes are distributed into space. Moreover, the effect of using a limited knowledge that each node possesses about friends of its friends is strongly nonlinear. We show that gains of such use grow statistically significantly only when this knowledge is limited to a small fraction of friends of friends.


2018 ◽  
Vol 51 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Zhijun Ding ◽  
Xiaolun Li ◽  
Changjun Jiang ◽  
Mengchu Zhou

2014 ◽  
Vol 75 (15) ◽  
pp. 8895-8919 ◽  
Author(s):  
Lei Jin ◽  
Ke Zhang ◽  
Jianfeng Lu ◽  
Yu-Ru Lin

Sign in / Sign up

Export Citation Format

Share Document