faiss
A library for efficient similarity search and clustering of dense vectors.
Search and group similar data points quickly, even with large sets of information that may not fit in memory.
From the README
- Hervé Jégou initiated the Faiss project and wrote its first implementation
- Matthijs Douze implemented most of the CPU Faiss
- Jeff Johnson implemented all of the GPU Faiss
- Lucas Hosseini implemented the binary indexes and the build system
- Chengqi Deng implemented NSG, NNdescent and much of the additive quantization code.
- Alexandr Guzhva many optimizations: SIMD, memory allocation and layout, fast decoding kernels for vector codecs, etc.
Excerpts from the project README on GitHub. Copyright and licensing remain with the respective authors.
Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.
Get an email alert on its next release or when it starts trending — never miss the moment.
Free · no card · unsubscribe anytimeA library for efficient similarity search and clustering of dense vectors.
faiss has 40.7k stars on GitHub. It has been forked 4.5k times. faiss is written mainly in C++. It has been in active development since 2017. faiss is available under the MIT license.
Read the full guideWhat is faiss?
A library for efficient similarity search and clustering of dense vectors.
Is faiss open source?
faiss is an open-source project. It is released under the MIT license.
Is faiss free?
Yes. faiss is free and open source — you can use, modify and self-host it.
What license does faiss use?
faiss is available under the MIT license.
What language is faiss written in?
faiss is written mainly in C++.
Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.
[](https://olud.ai/project/facebookresearch-faiss.html)
