Skip to content


Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Jamendo Recommendation SDK
branch: master

Fetching latest commit…

Cannot retrieve the latest commit at this time

Failed to load latest commit information.


Jamendo Recommendation SDK

The goal of this project is to start a community effort to improve music recommendations on Jamendo.

We want to provide all the tools and test datasets so that everyone can develop, test and submit their own algorithms.


We try to have a common format for all the datasets but it's not a strong requirement.

Currently it's : [User ID];[Item ID];[Rating];[Weight];[Date]

 - jamendoalbumreviews : Ratings of the albums by the users. All weights currently equal 0.5 but we could take into account some kind of "karma" for the users.

 - jamendoalbumstarred : Albums added to favourites of users ("stars"). Rating=Weight=1 ; We'll add the Date field on request.
 						This dataset currently doesn't work with the rest of the SDK and needs some love. 
 - jamendoalbumallrates : Use a tuple with different rates. This tuple has the form (reviews rate, 1 if starred, 1 if playlisted ). As jamendoartistallrates, 
 						 for such a dataset is used csv.Dataset_ratestuple that makes the eval parsing of the rate tuple and, using the test_algo, compute a
 						 global rate combining the subrates in the tuple. This kind of datasets is yielded using
 - jamendoartistallrates : Here rates are in the form (average of artist's albums reviews from that user, 1 if artist has been starred, #album starred/ #album published)
 						  Use csv.Dataset_ratestuple (see above). This dataset has the advantage to have the greatest data density, but we prefer to consider albums as 
 						  unit to be recoommend!  
You can have some stats on datasets using For instance launching 

	python jamendoalbumallrates.csv 

you get printed the number of users and items the dataset has some rates for, the number of the rates, and finally the matrix % of filing as a density measure. 
To evaluate a recommendation system effectiveness the number of users and items can be served is also important, and the higher density is, the best results can be reached! 
Is useful to compare our data with the one of netflix prize: As you can see their dataset has a very better density (1.7%) than
our best dataset (jamendoalbumallrates) with density of 0.019! This makes all more challenging for us ;-)
These two should be enough to get some algorithms started but feel free to ask us for more!


We've included a couple of simple ones to showcase the SDK. You should obviously be able to do better, of to tune the SVD implementation
that seems to yield good results.


Currently we're inspired by the Netflix Challenge, and use RMSE to compare algorithms. You may add others measures of course.

To test an algorithm, use the command :

	python [dataset] [algorithm]

You can also use "all" to compare them (defined in

	python jamendoalbumreviews all


There's a thread here :

We can also use the github issues feature to improve the SDK
Something went wrong with that request. Please try again.