Practice bipartite projections

Now that you understand the difference between graph structure and graph labelsiFull definition for label (opens in a new tab)A tag on a node that groups it with other nodes of the same kind. A node can carry more than one., and when to preserve labels in your projectionsiFull definition for projection (opens in a new tab)An in-memory copy of part of your database that graph algorithms run against. You choose which nodes and relationships it holds., it's time to practice creating bipartiteiFull definition for bipartite graph (opens in a new tab)A graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind. projections.

In this lesson, you'll work with the Movies dataset to create various labelled bipartite projections and run Node SimilarityiFull definition for node similarity (opens in a new tab)An algorithm that scores how alike two nodes are by comparing the neighbours they share. on them—an algorithm specifically designed to work with bipartite structures.