Deep Learning, Artificial Intelligence, Self Supervised Learning, Semi Supervised Learning, Graph Laplacian.
and T is a temperature parameter. The above equation generates a graph where each sample (node) i has k connections with the weight Wij while other connections are zero (no linkage). The symmetrically normalized counterpart of W is given by: where: With D is the degree matrix and 1n is an all-ones