View source
dev_kinan
change destination
master
  • Contributors
    1. Loading...
Author Commit Message Date Builds
17 commits behind dev_kinan.
Kinan Halloum
get_score is now much more efficient, in addition the similar playlist names are cached for more efficiency (most similar playlists generation for a given playlist name takes ~100ms. Similarity of track to a cached playlist names ~1ms)
selin.aydin@rwth-aachen.de
name_sim*.py files determine how well a track fits to a playlist name
selin.aydin@rwth-aachen.de
removed some dead code parts
selin.aydin@rwth-aachen.de
Code I used for generating the 7k recommendations
selin.aydin@rwth-aachen.de
no message
selin.aydin@rwth-aachen.de
Cleaned the code a bit
selin.aydin@rwth-aachen.de
Code is not cleaned yet, but the tracks for the playlists with zero tracks are generated (first 1000 playlists out of 1000000)
selin.aydin@rwth-aachen.de
Changed the analyzer of the TfidfVectorizer to n-grams to compare character n-grams and not words. Currently trying to find out how to handle emojis.
selin.aydin@rwth-aachen.de
tidying up my branch
selin.aydin@rwth-aachen.de
In the previous commit it was only possible to use existing playlist names and not newly invented.
selin.aydin@rwth-aachen.de
- Creating a list of playlist names reusing Kinan's code (approx. 30 min) - Computing the similarity of a playlist name to all other playlist names (in 10s :D) - Returns dataframe with pids of most similar playlist names