mlsanityData to 14 Oct 2026

Lens functions for exploring UMAP Projections with Domain Knowledge

arXiv 2405.09204 ↗First posted 15 May 2024cs.LG cs.CG cs.HCcited by 0

Not on the map. Why?

Abstract (arXiv)

Dimensionality reduction algorithms are often used to visualise high-dimensional data. Previously, studies have used prior information to enhance or suppress expected patterns in projections. In this paper, we adapt such techniques for domain knowledge guided interactive exploration. Inspired by Mapper and STAD, we present three types of lens functions for UMAP, a state-of-the-art dimensionality reduction algorithm. Lens functions enable analysts to adapt projections to their questions, revealing otherwise hidden patterns. They filter the modelled connectivity to explore the interaction between manually selected features and the data's structure, creating configurable perspectives each potentially revealing new insights. The effectiveness of the lens functions is demonstrated in two use cases and their computational cost is analysed in a synthetic benchmark. Our implementation is available in an open-source Python package: https://github.com/vda-lab/lensed_umap.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 53 references that are in the map. First posted on arXiv 15 May 2024.

Builds on

15 of 53 references.

References · 15

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  2. 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 413
  3. 2019Topological Autoencoderscited by 127
  4. 2013Discrete Signal Processing on Graphs: Frequency Analysiscited by 73
  5. 2020t-viSNE: Interactive Assessment and Interpretation of t-SNE Projectionscited by 43
  6. 2020Bringing UMAP Closer to the Speed of Light with GPU Accelerationcited by 19
  7. 2021Clustering with UMAP: Why and How Connectivity Matterscited by 9
  8. 2022Feature Learning for Nonlinear Dimensionality Reduction toward Maximal Extraction of Hidden Patternscited by 8
  9. 2022Manifold-aligned Neighbor Embeddingcited by 7
  10. 2020DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reductioncited by 5
  11. 2021Topologically Regularized Data Embeddingscited by 5
  12. 2023Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distributioncited by 5
3 more
  1. 2020Implicit Multidimensional Projection of Local Subspacescited by 4
  2. 2023ShaRP: Shape-Regularized Multidimensional Projectionscited by 4
  3. 2023Revised Conditional t-SNE: Looking Beyond the Nearest Neighborscited by 2

Built on by

Not cited yet.