Algorithms overview

Throughout the previous module, you already ran several GDSAnalysing data through the structure of its connections. Also the name of the Neo4j library that implements it. algorithms: degree centralityA score for each node equal to its number of outgoing relationships. and PageRankA centrality algorithm that scores a node by the number of nodes pointing at it and by how important those nodes are. on monopartite graphsA graph in which every node is the same kind of thing, so relationships connect like to like., and node similarityAn algorithm that scores how alike two nodes are by comparing the neighbours they share. on bipartite graphsA graph with two kinds of node, where every relationship joins one kind to the other and never two of the same kind..

Each algorithm revealed different insights about the same data.