Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm
Faced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user’s interest points according to the user’s behavior habits, thereby recommending the news that may be of i...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/8834908 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832550103589584896 |
|---|---|
| author | Kunni Han |
| author_facet | Kunni Han |
| author_sort | Kunni Han |
| collection | DOAJ |
| description | Faced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user’s interest points according to the user’s behavior habits, thereby recommending the news that may be of interest to the user. In this paper, improvements are made to the data preprocessing stage and the nearest neighbor collection stage of the collaborative filtering algorithm. In the data preprocessing stage, the user-item rating matrix is filled to alleviate its sparsity. The label factor and time factor are introduced to make the constructed user preference model have a better expression effect. In the stage of finding the nearest neighbor set, the collaborative filtering algorithm is combined with the dichotomous K-means algorithm, the user cluster matching the target user is selected as the search range of the nearest neighbor set, and the similarity measurement formula is improved. In order to verify the effectiveness of the algorithm proposed in this paper, this paper selects a simulated data set to test the performance of the proposed algorithm in terms of the average absolute error of recommendation, recommendation accuracy, and recall rate and compares it with the user-based collaborative filtering recommendation algorithm. In the simulation data set, the algorithm in this paper is superior to the traditional algorithm in most users. The algorithm in this paper decomposes the sparse matrix to reduce the impact of data sparsity on the traditional recommendation algorithm, thereby improving the recommendation accuracy and recall rate of the recommendation algorithm and reducing the recommendation error. |
| format | Article |
| id | doaj-art-e17a8530337d495d8faf55d6548f9b15 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-e17a8530337d495d8faf55d6548f9b152025-02-03T06:07:41ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/88349088834908Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering AlgorithmKunni Han0School of Journalism and Communication, Qingdao University, Qingdao 266071, ChinaFaced with massive amounts of online news, it is often difficult for the public to quickly locate the news they are interested in. The personalized recommendation technology can dig out the user’s interest points according to the user’s behavior habits, thereby recommending the news that may be of interest to the user. In this paper, improvements are made to the data preprocessing stage and the nearest neighbor collection stage of the collaborative filtering algorithm. In the data preprocessing stage, the user-item rating matrix is filled to alleviate its sparsity. The label factor and time factor are introduced to make the constructed user preference model have a better expression effect. In the stage of finding the nearest neighbor set, the collaborative filtering algorithm is combined with the dichotomous K-means algorithm, the user cluster matching the target user is selected as the search range of the nearest neighbor set, and the similarity measurement formula is improved. In order to verify the effectiveness of the algorithm proposed in this paper, this paper selects a simulated data set to test the performance of the proposed algorithm in terms of the average absolute error of recommendation, recommendation accuracy, and recall rate and compares it with the user-based collaborative filtering recommendation algorithm. In the simulation data set, the algorithm in this paper is superior to the traditional algorithm in most users. The algorithm in this paper decomposes the sparse matrix to reduce the impact of data sparsity on the traditional recommendation algorithm, thereby improving the recommendation accuracy and recall rate of the recommendation algorithm and reducing the recommendation error.http://dx.doi.org/10.1155/2020/8834908 |
| spellingShingle | Kunni Han Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm Complexity |
| title | Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm |
| title_full | Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm |
| title_fullStr | Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm |
| title_full_unstemmed | Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm |
| title_short | Personalized News Recommendation and Simulation Based on Improved Collaborative Filtering Algorithm |
| title_sort | personalized news recommendation and simulation based on improved collaborative filtering algorithm |
| url | http://dx.doi.org/10.1155/2020/8834908 |
| work_keys_str_mv | AT kunnihan personalizednewsrecommendationandsimulationbasedonimprovedcollaborativefilteringalgorithm |