A hybrid news recommendation algorithm based on user's browsing path

Author(s):  
Chen Li ◽  
Zhengtao Jiang
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.


2015 ◽  
Vol 55 ◽  
pp. 843-851 ◽  
Author(s):  
Rui Ren ◽  
Lingling Zhang ◽  
Limeng Cui ◽  
Bo Deng ◽  
Yong Shi

2019 ◽  
Vol 17 (1) ◽  
pp. 60-73
Author(s):  
Xiaoli Zhang

After analyzing the logistic regression and support vector machine's limitation, the author has chosen the learning to rank method to solve the problem of news recommendations. The article proposes two news recommendation methods which were based on Bayesian optimization criterion and RankSVM. In addition, the article also proposes two methods to solve the dynamic change of user interest and recommendation novelty and diversity. The experimental results show that the two methods can get ideal results, and the overall performance of the method based on Bayesian optimization criterion is better than that based on RankSVM.


2021 ◽  
Vol 1881 (3) ◽  
pp. 032050
Author(s):  
Jing Liu ◽  
Jinbao Song ◽  
Chen Li ◽  
Xiaoya Zhu ◽  
Ruyi Deng

Author(s):  
K Sobha Rani

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