Collaborative filtering recommendation algorithm based on user preference derived from item domain features

2014 ◽  
Vol 396 ◽  
pp. 66-76 ◽  
Author(s):  
Jing Zhang ◽  
Qinke Peng ◽  
Shiquan Sun ◽  
Che Liu
Keyword(s):  
Collaborative Filtering ◽  
User Preference ◽  
Recommendation Algorithm

scholarly journals A music recommendation algorithm based on clustering and latent factor model

2020 ◽  
Vol 309 ◽  
pp. 03009
Author(s):  
Yingjie Jin ◽  
Chunyan Han
Keyword(s):  
Collaborative Filtering ◽  
Large Scale ◽  
User Preference ◽  
Implicit Feedback ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Latent Factor ◽  
Latent Factor Models ◽  
Feedback Data ◽  
Preference Matrix

The collaborative filtering recommendation algorithm is a technique for predicting items that a user may be interested in based on user history preferences. In the recommendation process of music data, it is often difficult to score music and the display score data for music is less, resulting in data sparseness. Meanwhile, implicit feedback data is more widely distributed than display score data, and relatively easy to collect, but implicit feedback data training efficiency is relatively low, usually lacking negative feedback. In order to effectively solve the above problems, we propose a music recommendation algorithm combining clustering and latent factor models. First, the user-music play record data is processed to generate a user-music matrix. The data is then analyzed using a latent factor probability model on the resulting matrix to obtain a user preference matrix U and a musical feature matrix V. On this basis, we use two K- means algorithms to perform user clustering and music clustering on two matrices. Finally, for the user preference matrix and the commodity feature matrix that complete the clustering, a user-based collaborative filtering algorithm is used for prediction. The experimental results show that the algorithm can reduce the running cost of large-scale data and improve the recommendation effect.

scholarly journals Recommendation Algorithm in Double-Layer Network Based on Vector Dynamic Evolution Clustering and Attention Mechanism

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Jianrui Chen ◽  
Zhihui Wang ◽  
Tingting Zhu ◽  
Fernando E. Rosas
Keyword(s):  
Collaborative Filtering ◽  
Double Layer ◽  
State Of The Art ◽  
Single Layer ◽  
Attention Mechanism ◽  
User Preference ◽  
Recommendation Algorithm ◽  
Recommendation Algorithms ◽  
The Status ◽  
Single Layer Network

The purpose of recommendation systems is to help users find effective information quickly and conveniently and also to present the items that users are interested in. While the literature of recommendation algorithms is vast, most collaborative filtering recommendation approaches attain low recommendation accuracies and are also unable to track temporal changes of preferences. Additionally, previous differential clustering evolution processes relied on a single-layer network and used a single scalar quantity to characterise the status values of users and items. To address these limitations, this paper proposes an effective collaborative filtering recommendation algorithm based on a double-layer network. This algorithm is capable of fully exploring dynamical changes of user preference over time and integrates the user and item layers via an attention mechanism to build a double-layer network model. Experiments on Movielens, CiaoDVD, and Filmtrust datasets verify the effectiveness of our proposed algorithm. Experimental results show that our proposed algorithm can attain a better performance than other state-of-the-art algorithms.

scholarly journals Using Factor Decomposition Machine Learning Method to Music Recommendation

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Dapeng Sun
Keyword(s):  
Collaborative Filtering ◽  
User Satisfaction ◽  
User Behavior ◽  
Frequent Pattern ◽  
User Preference ◽  
Data Conversion ◽  
Learning Method ◽  
Music Recommendation ◽  
Recommendation Algorithm ◽  
Candidate Set

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.

Sign in / Sign up

Export Citation Format

Share Document