Marko Rodriguez gives us a step by step guide to building a graph-based movie recommender engine using the publicly available MovieLens dataset, the graph database Neo4j, and the graph traversal language Gremlin.

He uses the animated movie Toy Story to demonstrate traversing the MovieLens Graph, and dives into these questions:

  • Which users gave Toy Story more than 3 stars?
  • Which users gave Toy Story more than 3 stars and what other movies did they give more than 3 stars to?
  • How many of Toy Story’s highly co-rated movies are unique?
  • Which movies are most highly co-rated with Toy Story?
  • Which movies are most highly co-rated with Toy Story that share a genera with Toy Story?
  • Which movies are most highly co-rated with Toy Story that share all genres with Toy Story?
Check out his blog post here, keep it up Marko!




Want to learn more about graph databases? Click below to get your free copy of O’Reilly’s Graph Databases ebook and discover how to use graph technologies for your application today.

Download My Ebook

 


Leave a Reply

Your email address will not be published. Required fields are marked *

Subscribe

Upcoming Event

 


From the CEO

Emil's Blog


Have a Graph Question?

Stackoverflow
Slack
Contact Us

Share your Graph Story?

Email us: content@neotechnology.com


Popular Graph Topics