Scaled Properties and FastRP Embeddings

CentralityiFull definition for centrality (opens in a new tab)How important a node is within a graph. Each centrality algorithm defines importance differently. and community detectioniFull 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. reveal graph propertiesiFull definition for property (opens in a new tab)A named value stored on a node or a relationship.. EmbeddingsiFull definition for embedding (opens in a new tab)Information represented as a numerical vector, positioned so that similar information sits close together. encode them into vectors for machine learning.

In this lesson, you'll scale features, create embeddings with FastRPiFull definition for FastRP (opens in a new tab)A node embedding algorithm, short for Fast Random Projection. It builds each node's vector by combining random vectors drawn from the nodes around it., and cluster papers to compare with official subject labelsiFull definition for label (opens in a new tab)A tag on a node that groups it with other nodes of the same kind. A node can carry more than one..