mlsanityData to 7 Oct 2026

Sampling-enabled scalable manifold learning unveils the discriminative cluster structure of high-dimensional data

arXiv 2401.01100 ↗First posted 2 Jan 2024cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

As a pivotal branch of machine learning, manifold learning uncovers the intrinsic low-dimensional structure within complex nonlinear manifolds in high-dimensional space for visualization, classification, clustering, and gaining key insights. Although existing techniques have achieved remarkable successes, they suffer from extensive distortions of cluster structure, which hinders the understanding of underlying patterns. Scalability issues also limit their applicability for handling large-scale data. We hence propose a sampling-based Scalable manifold learning technique that enables Uniform and Discriminative Embedding, namely SUDE, for large-scale and high-dimensional data. It starts by seeking a set of landmarks to construct the low-dimensional skeleton of the entire data, and then incorporates the non-landmarks into the learned space based on the constrained locally linear embedding (CLLE). We empirically validated the effectiveness of SUDE on synthetic datasets and real-world benchmarks, and applied it to analyze single-cell data and detect anomalies in electrocardiogram (ECG) signals. SUDE exhibits distinct advantage in scalability with respect to data size and embedding dimension, and has promising performance in cluster separation, integrity, and global structure preservation. The experiments also demonstrate notable robustness in embedding quality as the sampling rate decreases.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 11 of its 74 references that are in the map. First posted on arXiv 2 Jan 2024.

Builds on

11 of 74 references.

References · 11

  1. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  4. 2019Topological Autoencoderscited by 124
  5. 2020Parametric UMAP embeddings for representation and semi-supervised learningcited by 103
  6. 2019TriMap: Large-scale Dimensionality Reduction Using Tripletscited by 59
  7. 2021Data-driven discovery of intrinsic dynamicscited by 45
  8. 2023Interpreting the Curse of Dimensionality from Distance Concentration and Manifold Effectcited by 14
  9. 2017Supervised Dimensionality Reduction for Big Datacited by 13
  10. 2017Landmark Diffusion Maps (L-dMaps): Accelerated manifold learning out-of-sample extensioncited by 9
  11. 2023MeanCut: A Greedy-Optimized Graph Clustering via Path-based Similarity and Degree Descent Criterioncited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.