Running algorithms
You've learned about execution modes and configuration. Now it's time to practice running algorithms with different configurations and see how those changes affect results.
In this lesson, you'll run iFull definition for degree centrality (opens in a new tab)A score for each node equal to its number of outgoing relationships., iFull definition for PageRank (opens in a new tab)A centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are. and iFull definition for Louvain algorithm (opens in a new tab)A community detection algorithm that repeatedly merges nodes into groups for as long as merging raises modularity. iFull definition for community detection (opens in a new tab)A family of algorithms that group nodes by how they connect. Each algorithm defines a community differently. on the actor collaboration network, experimenting with algorithm-specific configurations.
Join GraphAcademy to keep learning
Create your account to unlock 80+ hours of hands-on Neo4j courses, track your progress, and earn a certificate when you complete the course.
Sign in or register