annoy
hora
Our great sponsors
| annoy | hora | |
|---|---|---|
| 15 | 7 | |
| 9,893 | 2,172 | |
| 3.3% | 0.9% | |
| 4.0 | 6.0 | |
| 2 months ago | 7 months ago | |
| C++ | Rust | |
| Apache License 2.0 | Apache License 2.0 |
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.
annoy
-
Is doing knn on the output of a music artist classifier a good way to build a system that suggests new music?
Approximate Nearest Neighbors is what Spotify uses for music recommendations: https://github.com/spotify/annoy
-
Anatomy of a txtai index
embeddings - The embeddings index file. This is an Approximate Nearest Neighbor (ANN) index with either Faiss (default), Hnswlib or Annoy, depending on the settings.
-
Should we begin Linear Algebra with Matrices, or start with Vector Spaces?
Take for example Spotifies implementation of ANN https://github.com/spotify/annoy.
- Faiss: Facebook's open source vector search library
-
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.
-
Facebook AI Similarity Search (Faiss)
I’ve used annoy [0] for vector-similarity search before. Does anyone know the differences between Faiss and annoy? Thanks!
-
txtai - Semantic search backed by machine-learning powered workflows
🔎 Large-scale similarity search with multiple index backends (Faiss, Annoy, Hnswlib)
-
NLP Method(s) for Finding Commonalities?
Create a ANN search index using Annoy or FAISS
-
Announcing Hora 0.1.0, an approximate nearest neighbor search algorithm library in rust
How does this compare to something like annoy, it's used and written by Spotify.
-
[D] can you use a decision tree for clustering?
https://medium.com/@kevin_yang/simple-approximate-nearest-neighbors-in-python-with-annoy-and-lmdb-e8a701baf905
hora
- An efficient library for nearest neighbor search in native rust
-
Hora, an blazingly fast AI Similarity search algorithm library (IOS Version)
$ rustup target add aarch64-apple-ios aarch64-apple-ios $ cargo install cargo-lipo $ git clone https://github.com/hora-search/hora-ios $ cd hora-ios/hora $ cargo lipo --release
- Hora: Efficient approximate nearest neighbor search algorithms in Rust
- [Project] Announcing Hora 0.1.1, an blazingly fast AI Similarity search algorithm library
- [Project] Announcing Hora 0.1.0, an blazingly fast approximate nearest neighbor search algorithm library
-
Announcing Hora 0.1.0, an approximate nearest neighbor search algorithm library in rust
github: https://github.com/hora-search/hora
What are some alternatives?
faiss - A library for efficient similarity search and clustering of dense vectors.
implicit - Fast Python Collaborative Filtering for Implicit Feedback Datasets
hnswlib - Header-only C++/python library for fast approximate nearest neighbors
TensorRec - A TensorFlow recommendation algorithm and framework in Python.
vald - Vald. A Highly Scalable Distributed Vector Search Engine
spotlight - Deep recommender models using PyTorch.
milvus - An open-source vector database for scalable similarity search and AI applications.
fastFM - fastFM: A Library for Factorization Machines
libffm - A Library for Field-aware Factorization Machines
instant-distance - Fast approximate nearest neighbor searching in Rust, based on HNSW index
NumToA - An efficient method of heaplessly converting numbers into their string representations, storing the representation within a reusable byte array.
horapy - 🐍 Python bidding for the Hora Approximate Nearest Neighbor Search Algorithm library