Manifold learning: What, how, and why

M Meilă, H Zhang - Annual Review of Statistics and Its …, 2024 - annualreviews.org
Manifold learning (ML), also known as nonlinear dimension reduction, is a set of methods to
find the low-dimensional structure of data. Dimension reduction for large, high-dimensional …

A tutorial on spectral clustering

U Von Luxburg - Statistics and computing, 2007 - Springer
In recent years, spectral clustering has become one of the most popular modern clustering
algorithms. It is simple to implement, can be solved efficiently by standard linear algebra …

Umap: Uniform manifold approximation and projection for dimension reduction

L McInnes, J Healy, J Melville - arXiv preprint arXiv:1802.03426, 2018 - arxiv.org
UMAP (Uniform Manifold Approximation and Projection) is a novel manifold learning
technique for dimension reduction. UMAP is constructed from a theoretical framework based …

Post-processing for individual fairness

F Petersen, D Mukherjee, Y Sun… - Advances in Neural …, 2021 - proceedings.neurips.cc
Post-processing in algorithmic fairness is a versatile approach for correcting bias in ML
systems that are already used in production. The main appeal of post-processing is that it …

[图书][B] Handbook of cluster analysis

C Hennig, M Meila, F Murtagh, R Rocci - 2015 - books.google.com
This handbook provides a comprehensive and unified account of the main research
developments in cluster analysis. Written by active, distinguished researchers in this area …

Discrete signal processing on graphs

A Sandryhaila, JMF Moura - IEEE transactions on signal …, 2013 - ieeexplore.ieee.org
In social settings, individuals interact through webs of relationships. Each individual is a
node in a complex network (or graph) of interdependencies and generates data, lots of data …

[图书][B] Introduction to semi-supervised learning

X Zhu, AB Goldberg - 2022 - books.google.com
Semi-supervised learning is a learning paradigm concerned with the study of how
computers and natural systems such as humans learn in the presence of both labeled and …

Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace–Beltrami operator

N García Trillos, M Gerlach, M Hein… - Foundations of …, 2020 - Springer
We study the convergence of the graph Laplacian of a random geometric graph generated
by an iid sample from am-dimensional submanifold MM in R^ d R d as the sample size n …

Graph Laplacian regularization for image denoising: Analysis in the continuous domain

J Pang, G Cheung - IEEE Transactions on Image Processing, 2017 - ieeexplore.ieee.org
Inverse imaging problems are inherently underdetermined, and hence, it is important to
employ appropriate image priors for regularization. One recent popular prior-the graph …

Sinkformers: Transformers with doubly stochastic attention

ME Sander, P Ablin, M Blondel… - … Conference on Artificial …, 2022 - proceedings.mlr.press
Attention based models such as Transformers involve pairwise interactions between data
points, modeled with a learnable attention matrix. Importantly, this attention matrix is …