GitHub - kpich/lastfm-artist-path-finder: A toy to find the shortest path between two artists (probably through other artists)

kpich / lastfm-artist-path-finder Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

A toy to find the shortest path between two artists (probably through other artists)

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.gitignore		.gitignore
README		README
artistnode.py		artistnode.py
dijkstra.py		dijkstra.py
lastgraph.py		lastgraph.py
main.py		main.py
priodict.py		priodict.py

Repository files navigation

So if we have two musical artists A and B, this finds the shortest path from A and B between artists. That is, imagine a graph with nodes corresponding to musical artists and edges corresponding to a "similarity" relation (with weights -- lower weights <==> similar artists). This finds the shortest path between A and B!

Kind of. It's a bit trickier than that, but that's the basic intuition.

The "similarity" metric is given to us from last.fm (which uses User Library co-occurrence, among other things).