You already know: k-means, hierarchical clustering and PCA (Unsupervised learning); the multivariate Gaussian and maximum likelihood (Joint distributions, Probability); SVD (SVD and PCA).
Why this matters for Atlas. k-means gives hard assignments and assumes round clusters of similar size. A Gaussian mixture model (GMM) gives each point a probability of belonging to each cluster, allows elongated clusters of different sizes, and provides a density you can use for anomaly detection. It's fitted by expectation–maximization (EM), an algorithm pattern that reappears in many latent-variable models. And when you need to look at high-dimensional data, t-SNE and UMAP produce the familiar cluster maps, which are useful for exploration but are easy to over-read.
1. Gaussian mixtures and EM
The question. How do you fit clusters when you don't know which point belongs to which?
Start from nothing. A GMM says each point comes from one of K Gaussians: pick component k with probability πₖ, then draw x ~ N(μₖ, Σₖ). If we knew the assignments, fitting would be easy (per-cluster means and covariances); if we knew the parameters, assigning would be easy (Bayes' rule). EM alternates: the E-step computes each point's responsibilities γᵢₖ = p(component k | xᵢ); the M-step re-estimates πₖ, μₖ, Σₖ as responsibility-weighted averages. Each iteration never decreases the likelihood, so EM converges, but only to a local optimum: run several initializations and keep the best likelihood. k-means is the limit of EM with tiny, equal, round covariances and hard assignments.