By Neo4j Staff | September 26, 2011
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?
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
Share your Graph Story?
Email us: firstname.lastname@example.org
Have a Graph Question?
Reach out and connect with the Neo4j staff.Stackoverflow
Popular Graph Topics
- cypher (143)
- graph database (133)
- nosql (114)
- graphconnect (102)
- emil eifrem (76)
- graph visualization (55)
- Graph Databases (52)
- relational database (51)
- community (46)
- Big Data (45)