A Multi-factor Recommendation Algorithm for POI Recommendation

2018 ◽  
pp. 445-454 ◽  
Author(s):  
Rong Yang ◽  
Xiaofeng Han ◽  
Xingzhong Zhang
Keyword(s):  
Recommendation Algorithm ◽  
Poi Recommendation

scholarly journals P3OI-MELSH: Privacy Protection Target Point of Interest Recommendation Algorithm Based on Multi-Exploring Locality Sensitive Hashing

2021 ◽  
Vol 15 ◽  
Author(s):  
Desheng Liu ◽  
Linna Shan ◽  
Lei Wang ◽  
Shoulin Yin ◽  
Hui Wang ◽  
...  
Keyword(s):  
Social Network ◽  
Privacy Protection ◽  
Rapid Development ◽  
Locality Sensitive Hashing ◽  
Target Point ◽  
Interest Points ◽  
Recommendation Algorithm ◽  
Original Algorithm ◽  
Point Of Interest ◽  
Poi Recommendation

With the rapid development of social network, intelligent terminal and automatic positioning technology, location-based social network (LBSN) service has become an important and valuable application. Point of interest (POI) recommendation is an important content in LBSN, which aims to recommend new locations of interest for users. It can not only alleviate the information overload problem faced by users in the era of big data, improve user experience, but also help merchants quickly find target users and achieve accurate marketing. Most of the works are based on users' check-in history and social network data to model users' personalized preferences for interest points, and recommend interest points through collaborative filtering and other recommendation technologies. However, in the check-in history, the multi-source heterogeneous information (including the position, category, popularity, social, reviews) describes user activity from different aspects which hides people's life style and personal preference. However, the above methods do not fully consider these factors' combined action. Considering the data privacy, it is difficult for individuals to share data with others with similar preferences. In this paper, we propose a privacy protection point of interest recommendation algorithm based on multi-exploring locality sensitive hashing (LSH). This algorithm studies the POI recommendation problem under distributed system. This paper introduces a multi-exploring method to improve the LSH algorithm. On the one hand, it reduces the number of hash tables to decrease the memory overhead; On the other hand, the retrieval range on each hash table is increased to reduce the time retrieval overhead. Meanwhile, the retrieval quality is similar to the original algorithm. The proposed method uses modified LSH and homomorphic encryption technology to assist POI recommendation which can ensure the accuracy, privacy and efficiency of the recommendation algorithm, and it verifies feasibility through experiments on real data sets. In terms of root mean square error (RMSE), mean absolute error (MAE) and running time, the proposed method has a competitive advantage.

A graph neural network based algorithm for Point-of-Interest recommendation using social relation and time series

2021 ◽  
Vol 18 (4) ◽  
pp. 0-0
Keyword(s):  
Neural Network ◽  
Social Relationships ◽  
Euclidean Distance ◽  
User Behavior ◽  
Recommendation Algorithm ◽  
Social Time ◽  
Point Of Interest ◽  
Poi Recommendation ◽  
Location Based Social Networks ◽  
Time Information

POI recommendation has gradually become an important topic in the field of service recommendation, which is always achieved by mining user behavior patterns. However, the context information of the collaborative signal is not encoded in the embedding process of traditional POI recommendation methods, which is not enough to capture the collaborative signal among different users. Therefore, a POI recommendation algorithm is presented by using social-time context graph neural network model (GNN) in Location-based social networks. First, it finds similarities between different social relationships based on the users' social and temporal behavior. Then, the similarity among different users is calculated by an improved Euclidean distance. Finally, it integrates the graph neural network, the interaction bipartite graph of users and social-time information into the algorithm to generate the final recommendation list in this paper. Experiments on real datasets show that the proposed method is superior to the state-of-the-art POI recommendation methods.

TrustSVD: A Novel Trust-Based Matrix Factorization Model with User Trust and Item Ratings

2017 ◽  
Vol 7 (11) ◽  
pp. 7 ◽  
Author(s):  
K Sobha Rani
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
Data Sets ◽  
Real World Data ◽  
Recommendation Algorithm ◽  
Active User ◽  
Factorization Model ◽  
The Social ◽  
Matrix Factorization Technique

Collaborative filtering suffers from the problems of data sparsity and cold start, which dramatically degrade recommendation performance. To help resolve these issues, we propose TrustSVD, a trust-based matrix factorization technique. By analyzing the social trust data from four real-world data sets, we conclude that not only the explicit but also the implicit influence of both ratings and trust should be taken into consideration in a recommendation model. Hence, we build on top of a state-of-the-art recommendation algorithm SVD++ which inherently involves the explicit and implicit influence of rated items, by further incorporating both the explicit and implicit influence of trusted users on the prediction of items for an active user. To our knowledge, the work reported is the first to extend SVD++ with social trust information. Experimental results on the four data sets demonstrate that our approach TrustSVD achieves better accuracy than other ten counterparts, and can better handle the concerned issues.

Sign in / Sign up

Export Citation Format

Share Document