Tag
affinity-graphs
- Aug 19, 2026 Why t-SNE Preserves Neighborhoods but Distorts Distances The embedding minimizes one asymmetric divergence between two similarity distributions, so it pulls true neighbours together while almost ignoring far pairs, which makes cluster sizes and inter-cluster gaps artefacts of the optimization. machine learning
- Aug 2, 2025 Spectral Clustering and the Relaxation of Normalized Cut Turning points into a weighted graph, writing the partition cost as a cut, and relaxing the discrete indicator vector into an eigenvector problem explains why the method recovers non-convex groups and why the affinity scale decides the answer. machine learning