umap
pynndescent
umap | pynndescent | |
---|---|---|
10 | 4 | |
6,959 | 841 | |
- | - | |
8.3 | 6.3 | |
7 days ago | about 1 month ago | |
Python | Python | |
BSD 3-clause "New" or "Revised" License | BSD 2-clause "Simplified" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
umap
-
[OC] Clustering Images with OpenAI CLIP, T-SNE, UMAP & Plotly
UMAP GitHub repository: https://github.com/lmcinnes/umap
-
UMAP clustering in Ruby
Uniform Manifold Approximation and Projection (UMAP) is a well-known dimensionality reduction method along with t-SNE.
-
Introducing the Semantic Graph
A number of excellent topic modeling libraries exist in Python today. BERTopic and Top2Vec are two of the most popular. Both use sentence-transformers to encode data into vectors, UMAP for dimensionality reduction and HDBSCAN to cluster nodes.
-
Using the 80:20 rule, what top 20% of your tools, statistical tests, activities, etc. do you use to generate 80% of your results?
As with anything, it depends on the problem. But T-SNE and UMAP are often good.
-
[D] In UMAP and PyNNDescent, the conversion of Cosine and Correlation measures to distance metric seems problematic
UMAP distances.py: umap/distances.py at master · lmcinnes/umap (github.com)
-
I built an Image Search Engine using OpenAI CLIP and Images from Wikimedia
I used for this project Flask and OpenAI CLIP. For the vector search I used approximate nearest neighbors provided by spotify/annoy. I used Flask-SQLAlchemy with GeoAlchemy2 to query GPS coordinates. The embedding was done using UMAP.
-
We Analyzed 425,909 Favicons
side note: instead of t-SNE consider UMAP - provides better results (and it's much faster) https://github.com/lmcinnes/umap
-
Finding correlating features in a large dataset.
Sounds like a job for UMAP https://github.com/lmcinnes/umap ?
-
The most perplexing bug I've ever seen
I am a fairly experienced python developer/researcher (about 10 years), and have found a bug that breaks all of my intuitions. I am messing with the [UMAP](https://github.com/lmcinnes/umap) repository and trying to add the option to disable some additional features. I've stripped everything from it but have a [quick test that will run my UMAP version and compare the outputs with what the original gave](https://github.com/Andrew-Draganov/probabilistic_dim_reduction/blob/master/umap/nndescent_umap_test.py). Managing my random seeds, same inputs, all that.
-
Question about numpy method I found in github project
I'm currently reading through a project on github, https://github.com/lmcinnes/umap, and in `umap/umap_.py` at line 2287, they have this:
pynndescent
-
[D]: Best nearest neighbour search for high dimensions
I'll assume this is the link to pynndescent, looks cool! Thanks for sharing. I haven't used it before. Also seems like it's an approximate nearest neighbor algorithm, just FYI for others seeing this.
-
How to find "k" nearest embeddings in a space with a very large number of N embeddings (efficiently)?
If you just want quick in memory search then pynndescent is a decent option: it's easy to install, and easy to get running. Another good option is Annoy; it's just as easy to install and get running with python, but it is a little less performant if you want to do a lot of queries, or get a knn-graph quickly.
-
PynnDescent: Importing pickled index gives error - 'NNDescent' object has no attribute 'shape'
Using the latest version of PyNNDescent via pip install. Running this on Google Colab with python 3.7.13Followed the Docs and created an index with the paramspynnindex = pynndescent.NNDescent(arr, metric="cosine", n_neighbors=100)Everything works fine and I get results from pynnindex.neighbor_graph as expected.
-
[D] In UMAP and PyNNDescent, the conversion of Cosine and Correlation measures to distance metric seems problematic
PyNNDescent distances.py: pynndescent/distances.py at master · lmcinnes/pynndescent (github.com)
What are some alternatives?
minisom - :red_circle: MiniSom is a minimalistic implementation of the Self Organizing Maps
annoy - Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
giotto-tda - A high-performance topological machine learning toolbox in Python
ann-benchmarks - Benchmarks of approximate nearest neighbor libraries in Python
citrus - (distributed) vector database
Traccar - Traccar GPS Tracking System
faiss - A library for efficient similarity search and clustering of dense vectors.
vaex - Out-of-Core hybrid Apache Arrow/NumPy DataFrame for Python, ML, visualization and exploration of big tabular data at a billion rows per second 🚀
Openstreetmap - The Rails application that powers OpenStreetMap
CLIP - CLIP (Contrastive Language-Image Pretraining), Predict the most relevant text snippet given an image
Orion - Robust web visualization tool for OwnTracks location data