Algorithm 2.

Graph generation.

Divide features into batches;

For each batch of features, let each feature in the batch be the node;

Calculate the Euclidean distance between each node to the rest nodes in the graph;

Find nearest k neighbours for each node;

Assign a positive value at positions that correspond to k neighbours.