HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
lmcinnes
umap
Python2018–2024
lmcinnes / umap

umap

Uniform Manifold Approximation and Projection

11Distinct people
14Mentions
0Explicit recommenders
8.3KGitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

Uniform Manifold Approximation and Projection

GitHub

Where it is used

No documented product use was verified in the last source check.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

Mentioned in the same Hacker News threads. That is not proof they are substitutes.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by year14 dated mentions

Observed mentions: 2018-08-07 00:29:48 UTC to 2024-10-16 21:52:19 UTC.

0123452018-01-01 00:00:00 UTC to 2019-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments20182019-01-01 00:00:00 UTC to 2020-01-01 00:00:00 UTC (exclusive): 5 mentions; 1 submissions, 4 comments2020-01-01 00:00:00 UTC to 2021-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2021-01-01 00:00:00 UTC to 2022-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments20212022-01-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2023-01-01 00:00:00 UTC to 2024-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2024-01-01 00:00:00 UTC to 2025-01-01 00:00:00 UTC (exclusive): 4 mentions; 2 submissions, 2 comments2024

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
20182018-01-01 00:00:00 UTC2019-01-01 00:00:00 UTC202
20192019-01-01 00:00:00 UTC2020-01-01 00:00:00 UTC514
20202020-01-01 00:00:00 UTC2021-01-01 00:00:00 UTC202
20212021-01-01 00:00:00 UTC2022-01-01 00:00:00 UTC101
20222022-01-01 00:00:00 UTC2023-01-01 00:00:00 UTC000
20232023-01-01 00:00:00 UTC2024-01-01 00:00:00 UTC000
20242024-01-01 00:00:00 UTC2025-01-01 00:00:00 UTC422

What Hacker News says

14 sources
lmcinnes·Oct 16, 2024Submission

Show HN: Exploring five million Hacker News posts

This is a data map providing a view of all Hacker News stories with a score of at least 2 (to remove most of the spam). Stories are close together in the map if they have semantically similar titles. In the bottom left is a histogram of stories over time. Hovering on a bar will select stories from that year, and dragging a selection allows selecting multiple years. A keyword based text search is in the upper left. Hold down the shift key and drag to lasso-select points and get a word cloud generated from the selection. Clicking on a point will open the URL for that story. The dataset was filtered from https://huggingface.co/datasets/OpenPipe/hacker-news Stories were embedded in a vector space via nomic-embed: https://huggingface.co/nomic-ai/nomic-embed-text-v1.5 A 2D representation was generated using UMAP: https://github.com/lmcinnes/uma
Read the rest
p Clusters were generated and topics named via HDBSCAN and Toponymy using Cohere Command-R: - https://github.com/TutteInstitute/fast_hdbscan - https://github.com/TutteInstitute/toponymy - https://cohere.com/command The interactive map was generated using DataMapPlot: https://github.com/TutteInstitute/datamapplot The map provides a great way to get an overview of Hacker News stories over the years, and to explore them, and find interesting niche topics. There are limitations to both the text embedding and the 2D representation. For example posts about John Gruber's "Daring Fireball" end up in "Sun-related phenomena" in the Astronomy region of the map; and some topics get squashed into odd places because of the limits of a 2D representation. Nonetheless, most topics, regions and stories are well placed. There is a wealth of knowledge and information packed in here, and a lot to explore.
3 points · Open discussion
lmcinnes·Oct 15, 2024Submission

Show HN: An interactive explorable map of 5M Hacker News stories

This is a data map providing a view of all HackerNews stories with a score of at least 2 (to remove most of the spam). Stories are close together in the map if they have semantically similar titles. In the bottom left is a histogram of stories over time. Hovering on a bar will select stories from that year, and dragging a selection allows selecting multiple years. A keyword based text search is in the upper left. Hold down the shift key and drag to lasso-select points and get a word cloud generated from the selection. Clicking on a point will open the URL for that story. The dataset was filtered from https://huggingface.co/datasets/OpenPipe/hacker-news Stories were embedded in a vector space via nomic-embed: https://huggingface.co/nomic-ai/nomic-embed-text-v1.5 A 2D representation was generated using UMAP: https://github.com/lmcinnes/umap
Read the rest
Clusters were generated and topics named via HDBSCAN and Toponymy using Cohere Command-R: - https://github.com/TutteInstitute/fast_hdbscan - https://github.com/TutteInstitute/toponymy - https://cohere.com/command The interactive map was generated using DataMapPlot: https://github.com/TutteInstitute/datamapplot The map provides a great way to get an overview of Hacker News stories over the years, and to explore them, and find interesting niche topics. There are limitations to both the text embedding and the 2D representation. For example posts about John Gruber's "Daring Fireball" end up in "Sun-related phenomena" in the Astronomy region of the map; and some topics get squashed into odd places because of the limits of a 2D representation. Nonetheless, most topics, regions and stories are well placed. There is a wealth of knowledge and information packed in here, and a lot to explore.
3 points · Open discussion
In my experience, unsupervised learning is more broadly useful (and easier to implement) than supervised learning. Use it for data exploration, data validation, anomaly detection, topic modeling, recommender systems, cluster analysis, etc. Recommended algorithms: - UMAP (https://github.com/lmcinnes/umap/blob/master/README.rst) - HDBSCAN (https://github.com/scikit-learn-contrib/hdbscan/blob/master/...) - MatrixProfile (https://github.com/target/matrixprofile-ts/blob/master/READM...) - NMF (https://scikit-learn.org/stable/modules/generated/sklearn.de...)
In Ask HN: What Technologies to Learn in 2020?
Here’s a pretty comprehensive answer on the topic from the original UMAP author: https://github.com/lmcinnes/umap/issues/25 Clustering the output of UMAP is also given a nice tutorial in the docs: https://umap-learn.readthedocs.io/en/latest/clustering.html Basically, the answer is yes you can do this, but verify and analyze the output to ensure it makes sense (e.g. coloring points by known features/labels). For example, if you have a small number of points in the dataset (<1000), UMAP tends to display a dense cluster that is quite separated from the remaining data. However, this apparent cluster is spurious and contains noisy data points that UMAP couldn’t “figure out what to do with” (they are similar in their dissimilarity to the other data).
In How UMAP Works
Indeed, there is the unfortunate fact that directly pointing out that a particular person has not read the paper is against HN's rules. Let us not violate the Prime Directive further. If I understand the origin of this paper correctly, it is mainly the idea and work of an undergraduate student. From this perspective, several problems become more understandable. The limited computation done in support of the paper may have been done by a setup as meager as a lone student's laptop. The naïve view of machine learning as a field could be explained by undergraduate eagerness; indeed, perhaps they did "recently [find] out about least squares". I agree with your thoughts on SGD. The authors did do PCA for some of their tests, but this entire setup should be buildable in a more efficient and incremental way. I think, however, that the reason that
Read the rest
this paper got the other three co-authors on it, despite its controversial nature, is that the core of the original idea is interesting and has yielded related fruit like UMAP [0] in the past. We should be more comfortable exploring it. I like your book reference. It's informative and direct, without mumbo-jumbo. To accelerate the lookup for the next follower, start at p279. [0] https://github.com/lmcinnes/umap
In Neural Networks Are Essentially Polynomial Regression (2018)
The name UMap is a bit unfortunate, as that is also an abbreviation for Uniform Manifold Approximation and Projection, which is a kind of mathematically more robust tSNE. In fact, for a split-second I was kind of hoping someone had figured out an interesting way of applying that technique to OSM data. Also, the demo doesn't load for me in any browser I throw at it - at first I thought it was my overly strict security settings, but I'm getting 404s even when running Chromium without any privacy plugins, adblockers. [0] https://github.com/lmcinnes/umap
In UMap: create maps with OpenStreetMap layers

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.