Deep Learning, Artificial Intelligence, Self Supervised Learning, Semi Supervised Learning, Graph Laplacian.
estimated using the BYOL-pretrained model. 3.2. Nearest Neighbor Graph Using Self-Supervised-Pretrained Model Based on the metric l(fθ(xi), fθ(xj)), a nearest neighbor graph can be built in the form of sparse adjacency matrix W: where NN(i, k) denotes the index set of the k nearest neighbors of xi,