Challenge: Weighted graph projection and analysis

You've learned how to project graphs with undirected relationshipsA relationship with no direction. Neo4j GDS represents them as parallel relationships in opposite directions. and weights. You've used Node SimilarityAn algorithm that scores how alike two nodes are by comparing the neighbours they share. in the previous lesson to find similar movies and write relationshipsA named, directed connection between two nodes. Every relationship has a type, a start node and an end node. back to the database.

Now it's time to take Node Similarity further by using it in stream mode on a directed, weighted, bipartite graphA graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind. to analyze user similarity without writing back to the database.