Personalised recommendation algorithm for social network based on two-dimensional correlation

Author(s):  
Aimei Zhu
2016 ◽  
Vol 7 (3) ◽  
pp. 99-118 ◽  
Author(s):  
Firas Ben Kharrat ◽  
Aymen Elkhleifi ◽  
Rim Faiz

This paper puts forward a new recommendation algorithm based on semantic analysis as well as new measurements. Like Facebook, Social network is considered as one of the most well-prominent Web 2.0 applications and relevant services elaborating into functional ways for sharing opinions. Thereupon, social network web sites have since become valuable data sources for opinion mining. This paper proposes to introduce an external resource a sentiment from comments posted by users in order to anticipate recommendation and also to lessen the cold-start problem. The originality of the suggested approach means that posts are not merely characterized by an opinion score, but receive an opinion grade notion in the post instead. In general, the authors' approach has been implemented with Java and Lenskit framework. The study resulted in two real data sets, namely MovieLens and TripAdvisor, in which the authors have shown positive results. They compared their algorithm to SVD and Slope One algorithms. They have fulfilled an amelioration of 10% in precision and recall along with an improvement of 12% in RMSE and nDCG.


2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Kefei Cheng ◽  
Xiaoyong Guo ◽  
Xiaotong Cui ◽  
Fengchi Shan

The recommendation algorithm can break the restriction of the topological structure of social networks, enhance the communication power of information (positive or negative) on social networks, and guide the information transmission way of the news in social networks to a certain extent. In order to solve the problem of data sparsity in news recommendation for social networks, this paper proposes a deep learning-based recommendation algorithm in social network (DLRASN). First, the algorithm is used to process behavioral data in a serializable way when users in the same social network browse information. Then, global variables are introduced to optimize the encoding way of the central sequence of Skip-gram, in which way online users’ browsing behavior habits can be learned. Finally, the information that the target users’ have interests in can be calculated by the similarity formula and the information is recommended in social networks. Experimental results show that the proposed algorithm can improve the recommendation accuracy.


2013 ◽  
Vol 14 (2) ◽  
pp. 15-24 ◽  
Author(s):  
Hyeon Jo ◽  
Jong-Hyun Hong ◽  
Joon Yeon Choeh ◽  
Soung Hie Kim

Sign in / Sign up

Export Citation Format

Share Document