Link Prediction and Node Classification Based on Multitask Graph Autoencoder

Algorithm 1

 

Mixed local neighbor and path.

Input: edge list

Output: similarity matrix, AUC score

1: Input adjacency matrix

2: Divide all edges into the training set and probe set

3: Construct the third-order path matrix with attenuation parameters

4: Construct optimized common neighbor matrix

5: Construct matrix based on the method of preferential attachment

6: Calculate the similarity matrix that incorporates multiple methods

7: Calculate the AUC score of the MLNP index