Online Course Applied Graph Algorithms Setup and Cypher Refresher Category Hierarchy Ordering Search Results Most Relevant Reviews Photo Based Gallery Recommendations Summary: Applied Graph Algorithms Want to Speak? Get $ back. Most Relevant Reviews PageRank overview and problem statement In… Read more →
Most Relevant Reviews
PageRank overview and problem statement
In this section you will use the Personalized PageRank algorithm to identify “trusted” users, and present reviews from those users when viewing reviews of businesses.
- In Neo4j Browser, perform the steps in the Neo4j Browser guide section Relevant Reviews. (:play applied_graph_algorithms/04_relevant_reviews.html)
In CodeSandbox, edit the Cypher query in
src/exercises/exercise3.jsto return reviews ordered by whether or not the business has been reviewed by a “trusted” user.
- Save this file.
In CodeSandbox Browser:
- Perform a search on behalf of as user by first selecting a user.
- Select the Restaurant category.
- In the search pane, specify the string Mamma for the name of the restaurant. This will search for restaurants that start with that name and have reviews that are most relevant to the user. The remaining reviews are in chronological order.
- You can select a restaurant to see the reviews.
If you get stuck, watch this video for a walk-through of the solution:
Most relevant reviews exercise solution
Algorithm Understanding: Personalized PR
Which of the following best describe the Personalized PageRank algorithm?
Select the correct answer.
- It measures similarity of the structural context in which objects occur, based on their relationships with other objects.
- It is a variation of the PageRank algorithm that is biased towards a set of source nodes.
- It computes the influence of a node by measuring the number of the immediate neighbors and also all other nodes in the network that connect to the node under consideration through these immediate neighbors.
- It is a variation of the PageRank algorithm that reduces the bias that PageRank has towards assigning higher scores to nodes with relationships from nodes that have few outgoing relationships.