Skip to main content

Node Classification


Prediction can be done at the node level. The basis of such prediction systems are features extracted from graph entities.

Extracting a feature can be a complicated problem, and it can be based on different graph attributes — node properties, node adjacency, or the structure of the neighborhood.

Traditional methods of extracting knowledge from nodes include measures of centrality, importance, or feature structure such as graphlets.

Somewhat more advanced methods are extracting the embedding of individual nodes, and then a prediction algorithm that takes knowledge from the embeddings themselves. The most popular such tool is Node2Vec.

However, these methods are only a few. Today's graph machine learning is being developed and among them, we distinguish many different models such as:

  1. GraphSAGE
  2. DeepWalk
  3. Graph convolutional networks (GCN)
  4. Graph Attention Network (GAT)

and many, many more. This task has become quite popular and is used in many industries where knowledge is stored in the form of a graph structure.


Previously labeled nodes can be used to determine the class of unclassified ones



Node Classification

Unfortunately, Node Classification is yet not implemented within the project MAGE. Be sure to raise the issue on the GitHub repo and ping us to speed up the development. ☝️

Use cases


Classifying nodes based on previously labeled data can help investigators to find out fraudsters in finance systems. Since fraudsters can often act very quickly with their tricks, applying a streaming-based node classification can help up building a real-time fraud detection system.

Computer Security

Fraudsters usually behave differently than common users. This way a system can be observed and once an unusual behavior is spotted it can immediately be revealed. This can help build a bulletproof computer security system.