The [Formula: see text] -invariant graph Laplacian Part I: Convergence rate and eigendecomposition
{{output}}
Graph Laplacian based algorithms for data lying on a manifold have been proven effective for tasks such as dimensionality reduction, clustering, and denoising. In this work, we consider data sets whose data points lie on a manifold that is closed under the act... ...