Javascript must be enabled to continue!
A music recommendation algorithm based on clustering and latent factor model
View through CrossRef
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.
Title: A music recommendation algorithm based on clustering and latent factor model
Description:
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.
Related Results
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Music and Mysticism
Music and Mysticism
The word “mystic” has a common meaning in philosophical traditions like neo-Platonism and religions (Hindu, Jewish, Christian, and Muslim)—namely the elevation of a human being to ...
Owner Bound Music: A study of popular sheet music selling and music making in the New Zealand home 1840-1940
Owner Bound Music: A study of popular sheet music selling and music making in the New Zealand home 1840-1940
<p>From 1840, when New Zealand became part of the British Empire, until 1940 when the nation celebrated its Centennial, the piano was the most dominant instrument in domestic...
Epidemiological, diagnostic and medical-social aspects of latent syphilis
Epidemiological, diagnostic and medical-social aspects of latent syphilis
Objective — to study epidemiological, clinical and medical-social aspects of latent syphilis in Ukraine over the past 40 years.
Materials and methods. Data of patients with latent ...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
<p>Clustering is an important technique for data analysis and knowledge discovery. In the context of big data, the density-based clustering algorithm faces three challenging ...
Identifying Links Between Latent Memory and Speech Recognition Factors
Identifying Links Between Latent Memory and Speech Recognition Factors
Objectives:
The link between memory ability and speech recognition accuracy is often examined by correlating summary measures of performance across various tasks, but i...
Image clustering using exponential discriminant analysis
Image clustering using exponential discriminant analysis
Local learning based image clustering models are usually employed to deal with images sampled from the non‐linear manifold. Recently, linear discriminant analysis (LDA) based vario...

