Research on collaborative filtering recommendation algorithm based on user behavior characteristics

Author(s):  
Mao Jianjun
Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Dapeng Sun

The user data mining was introduced into the model construction process, and the user behavior was decomposed by analyzing various influencing factors through the factorization machine (FM) learning method. In the recommendation screening stage, the collaborative filtering recommendation is combined to screen the recommendation candidate set. The idea of user-based collaborative filtering (CF) is used for reference to obtain music works favored by similar users. On the other hand, we learn from item-based CF, which ensures that the candidate set covers user preference. Firstly, the user’s interest value is predicted by using dynamic interest model. Then, the common problems such as cold start and hot items processing are fully considered. The frequent pattern growth algorithm is compared with the association rule algorithm based on the collaborative filtering recommendation algorithm and the content-based recommendation algorithm, which proves the superiority of the algorithm and its role in solving the recommendation problem after applying the recommendation. The music data in the database data conversion effectively improve the efficiency and accuracy of mining. According to the implementation of the algorithm described in this article, the accuracy of the music recommendation results used to recommend user satisfaction is proved. And the recommended music is indeed feasible and practical.


2020 ◽  
Vol 14 ◽  
Author(s):  
Amreen Ahmad ◽  
Tanvir Ahmad ◽  
Ishita Tripathi

: The immense growth of information has led to the wide usage of recommender systems for retrieving relevant information. One of the widely used methods for recommendation is collaborative filtering. However, such methods suffer from two problems, scalability and sparsity. In the proposed research, the two issues of collaborative filtering are addressed and a cluster-based recommender system is proposed. For the identification of potential clusters from the underlying network, Shapley value concept is used, which divides users into different clusters. After that, the recommendation algorithm is performed in every respective cluster. The proposed system recommends an item to a specific user based on the ratings of the item’s different attributes. Thus, it reduces the running time of the overall algorithm, since it avoids the overhead of computation involved when the algorithm is executed over the entire dataset. Besides, the security of the recommender system is one of the major concerns nowadays. Attackers can come in the form of ordinary users and introduce bias in the system to force the system function that is advantageous for them. In this paper, we identify different attack models that could hamper the security of the proposed cluster-based recommender system. The efficiency of the proposed research is validated by conducting experiments on student dataset.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Triyanna Widiyaningtyas ◽  
Indriana Hidayah ◽  
Teguh B. Adji

AbstractCollaborative filtering is one of the most widely used recommendation system approaches. One issue in collaborative filtering is how to use a similarity algorithm to increase the accuracy of the recommendation system. Most recently, a similarity algorithm that combines the user rating value and the user behavior value has been proposed. The user behavior value is obtained from the user score probability in assessing the genre data. The problem with the algorithm is it only considers genre data for capturing user behavior value. Therefore, this study proposes a new similarity algorithm – so-called User Profile Correlation-based Similarity (UPCSim) – that examines the genre data and the user profile data, namely age, gender, occupation, and location. All the user profile data are used to find the weights of the similarities of user rating value and user behavior value. The weights of both similarities are obtained by calculating the correlation coefficients between the user profile data and the user rating or behavior values. An experiment shows that the UPCSim algorithm outperforms the previous algorithm on recommendation accuracy, reducing MAE by 1.64% and RMSE by 1.4%.


Sign in / Sign up

Export Citation Format

Share Document