Research on News Recommendation Algorithm Based on User Interest and Timeliness Modeling

2021 ◽  
Author(s):  
Zhongtai Qin ◽  
Mingjun Zhang
Keyword(s):  
User Interest ◽  
Recommendation Algorithm ◽  
News Recommendation

Research on Recommendation Algorithm Based on Ranking Learning

2019 ◽  
Vol 17 (1) ◽  
pp. 60-73
Author(s):  
Xiaoli Zhang
Keyword(s):  
Learning To Rank ◽  
Dynamic Change ◽  
Optimization Criterion ◽  
Bayesian Optimization ◽  
Support Vector ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Overall Performance ◽  
News Recommendation ◽  
Better Than

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.

A Collaborative Filtering Recommendation Algorithm Incorporated with Life Cycle

2013 ◽  
Vol 765-767 ◽  
pp. 630-633 ◽  
Author(s):  
Chong Lin Zheng ◽  
Kuang Rong Hao ◽  
Yong Sheng Ding
Keyword(s):  
Life Cycle ◽  
Collaborative Filtering ◽  
Recommendation Systems ◽  
Experimental Results ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Time Information ◽  
Successful Technology

Collaborative filtering recommendation algorithm is the most successful technology for recommendation systems. However, traditional collaborative filtering recommendation algorithm does not consider the change of time information. For this problem,this paper improve the algorithm with two new methods:Predict score incorporated with time information in order to reflect the user interest change; Recommend according to scores by adding the weight information determined by the item life cycle. Experimental results show that the proposed algorithm outperforms the traditional item in accuracy.

A Webpage Ranking Algorithm Based on Collaborative Recommendation

2013 ◽  
Vol 765-767 ◽  
pp. 998-1002
Author(s):  
Shao Xuan Zhang ◽  
Tian Liu
Keyword(s):  
Sorting Algorithm ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Search Results ◽  
Collaborative Recommendation ◽  
Interest Model ◽  
Sorting Efficiency ◽  
User Interest Model ◽  
Relevant Calculation ◽  
Personalized Ranking

In view of the present personalized ranking of search results user interest model construction difficult, relevant calculation imprecise problems, proposes a combination of user interest model and collaborative recommendation algorithm for personalized ranking method. The method from the user search history, including the submit query, click the relevant webpage information to train users interest model, then using collaborative recommendation algorithm to obtain with common interests and neighbor users, on the basis of these neighbors on the webpage and webpage recommendation level associated with the users to sort the search results. Experimental results show that: the algorithm the average minimum precision than general sorting algorithm was increased by about 0.1, with an increase in the number of neighbors of the user, minimum accuracy increased. Compared with other ranking algorithms, using collaborative recommendation algorithm is helpful for improving webpage with the user interest relevance precision, thereby improving the sorting efficiency, help to improve the search experience of the user.

A Video Recommendation Algorithm Based on Hyperlink-Graph Model

2017 ◽  
Vol 5 (3) ◽  
pp. 49-63
Author(s):  
Songtao Shang ◽  
Wenqian Shang ◽  
Minyong Shi ◽  
Shuchao Feng ◽  
Zhiguo Hong
Keyword(s):  
Graph Model ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Internet Users ◽  
Recommendation Algorithms ◽  
The Matrix ◽  
Personal Recommendation ◽  
Low Efficiency ◽  
Sports Videos ◽  
Video Recommendation

The traditional graph-based personal recommendation algorithms mainly depend the user-item model to construct a bipartite graph. However, the traditional algorithms have low efficiency, because the matrix of the algorithms is sparse and it cost lots of time to compute the similarity between users or items. Therefore, this paper proposes an improved video recommendation algorithm based on hyperlink-graph model. This method cannot only improve the accuracy of the recommendation algorithms, but also reduce the running time. Furthermore, the Internet users may have different interests, for example, a user interest in watching news videos, and at the same time he or she also enjoy watching economic and sports videos. This paper proposes a complement algorithm based on hyperlink-graph for video recommendations. This algorithm improves the accuracy of video recommendations by cross clustering in user layers.

scholarly journals Dynamical Modeling, Analysis, and Control of Information Diffusion over Social Networks: A Deep Learning-Based Recommendation Algorithm in Social Network

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Kefei Cheng ◽  
Xiaoyong Guo ◽  
Xiaotong Cui ◽  
Fengchi Shan
Keyword(s):  
Social Networks ◽  
Deep Learning ◽  
Social Network ◽  
Information Diffusion ◽  
Recommendation Algorithm ◽  
Central Sequence ◽  
Modeling Analysis ◽  
News Recommendation ◽  
Browsing Behavior ◽  
And Control

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.

Two Phase Recommendation Algorithm Based on Clustering User Interest and Trust

2014 ◽  
Vol 543-547 ◽  
pp. 1856-1859
Author(s):  
Xiang Cui ◽  
Gui Sheng Yin
Keyword(s):  
Social Networks ◽  
Electronic Commerce ◽  
Recommender Systems ◽  
Information Overload ◽  
User Interest ◽  
Recommendation Algorithm ◽  
Two Phase ◽  
Rating Data ◽  
User Interests ◽  
The Future

Recommender systems have been proven to be valuable means for Web online users to cope with the information overload and have become one of the most powerful and popular tools in electronic commerce. We need a method to solve such as what items to buy, what music to listen, or what news to read. The diversification of user interests and untruthfulness of rating data are the important problems of recommendation. In this article, we propose to use two phase recommendation based on user interest and trust ratings that have been given by actors to items. In the paper, we deal with the uncertain user interests by clustering firstly. In the algorithm, we compute the between-class entropy of any two clusters and get the stable classes. Secondly, we construct trust based social networks, and work out the trust scoring, in the class. At last, we provide some evaluation of the algorithms and propose the more improve ideas in the future.

Sign in / Sign up

Export Citation Format

Share Document