Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
Computation of a measure dealing with relevance of links between nodes
Idea : 2 guys are close if they have many common friends. In a more formalized way, and with the idea of directionality : a node N1 has a strong relation to N2 if there are many nodes Ci for which :
- A links to Ci
- Ci links to B
The number of links from A must be taken into account. Then the relevance of the link A→B is (number of links from A divided by the number of "Ci" nodes. From a probabilistic point of view, the relevance of the link A→B is proportional to the probability of accessing B from A in 2 steps during a random walk in Knownodes.
Take a look at the
import/cypherQueries.cypher file to see how we were able to calculate these relevance values using Neo4j.