Search Results for "k nearest neighbor"
Sort By:
Showing 73 open source projects for "k nearest neighbor"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
Elastiknn
Elasticsearch plugin for nearest neighbor search
Elasticsearch plugin for nearest neighbor search. Store vectors and run similarity searches using exact and approximate algorithms. Methods like word2vec and convolutional neural nets can convert many data modalities (text, images, users, items, etc.) into numerical vectors, such that pairwise distance computations on the vectors correspond to semantic similarity of the original data. -
2
pgvector
Open-source vector similarity search for Postgres
pgvector is an open-source PostgreSQL extension that equips PostgreSQL databases with vector data storage, indexing, and similarity search capabilities—ideal for embeddings-based applications like semantic search and recommendations. You can add an index to use approximate nearest neighbor search, which trades some recall for speed. Unlike typical indexes, you will see different results for queries after adding an approximate index. An HNSW index creates a multilayer graph. It has better query performance than IVFFlat (in terms of speed-recall tradeoff), but has slower build times and uses more memory. Also, an index can be created without any data in the table since there isn’t a training step like IVFFlat. -
3
DINOv2
PyTorch code and models for the DINOv2 self-supervised learning
DINOv2 is a self-supervised vision learning framework that produces strong, general-purpose image representations without using human labels. It builds on the DINO idea of student–teacher distillation and adapts it to modern Vision Transformer backbones with a carefully tuned recipe for data augmentation, optimization, and multi-crop training. The core promise is that a single pretrained backbone can transfer well to many downstream tasks—from linear probing on classification to retrieval,... -
4
MiniRAG
Making RAG Simpler with Small and Open-Sourced Language Models
MiniRAG is a lightweight retrieval-augmented generation tool designed to bring the benefits of RAG workflows to smaller datasets, edge environments, and constrained compute settings by simplifying embedding, indexing, and retrieval. It extracts text from documents, codes, or other structured inputs and converts them into embeddings using efficient models, then stores these vectors for fast nearest-neighbor search without requiring huge databases or separate vector servers. When a query is issued, MiniRAG retrieves the most relevant contexts and feeds them into a generative model to produce an answer that is grounded in the source material rather than hallucinated. Its minimal footprint makes it suitable for local research assistants, chatbots, help desks, or knowledge bases embedded in applications with limited resources. ... -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
Engram
A New Axis of Sparsity for Large Language Models
Engram is a high-performance embedding and similarity search library focused on making retrieval-augmented workflows efficient, scalable, and easy to adopt by developers building search, recommendation, or semantic matching systems. It provides utilities to generate embeddings from text or other structured data, index them using efficient approximate nearest neighbor algorithms, and perform real-time similarity queries even on large corpora. Engineered with speed and memory efficiency in mind, Engram supports batched indexing, incremental updates, and custom distance metrics so developers can tailor search behaviors to their domain’s needs. In addition to raw similarity search, the project includes tools for clustering, ranking, and filtering results, enabling richer user experiences like “related content”, semantic auto-completion, and contextual filtering. -
6
Qdrant
Vector Database for the next generation of AI applications
...Implement a unique custom modification of the HNSW algorithm for the Approximate Nearest Neighbor Search. Search with a State-of-the-Art speed and apply search filters without compromising on results. Support additional payload associated with vectors. Not only stores payload but also allows filter results based on payload values. Unlike Elasticsearch post-filtering, Qdrant guarantees all relevant vectors are retrieved. -
7
LEANN
Local RAG engine for private multimodal knowledge search on devices
...It focuses on dramatically reducing the storage overhead typically required for vector search and embedding indexes, enabling efficient large-scale knowledge retrieval on consumer hardware. LEANN introduces a storage-efficient approximate nearest neighbor index combined with on-the-fly embedding recomputation to avoid storing large embedding vectors. By recomputing embeddings during queries and using compact graph-based indexing structures, LEANN can maintain high search accuracy while minimizing disk usage. It aims to act as a unified personal knowledge layer that connects different types of data such as documents, code, images, and other local files into a searchable context for language models. -
8
VectorChord
Scalable, fast, and disk-friendly vector search in Postgres
VectorChord is an open-source vector database built for local and edge deployment. It supports efficient vector indexing and retrieval using ANN (approximate nearest neighbor) algorithms and is optimized for integration with LLM and AI applications. VectorChord is lightweight and can be embedded in a variety of environments for fast semantic search. -
9
Embedding Atlas
Tool that provides interactive visualizations for large embeddings
Embedding Atlas is an open-source tool by Apple that provides scalable, interactive visualizations for large embedding datasets. It enables users to visualize, cross-filter, and search through embeddings alongside rich metadata, all in real time using modern web-based technologies. In addition to the command line tool, Embedding Atlas is also available as a Jupyter widget. Finally, components from Embedding Atlas are also available in an npm package. Order-independent transparency ensuring... -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
10
CocoIndex
ETL framework to index data for AI, such as RAG
CocoIndex is an open-source framework designed for building powerful, local-first semantic search systems. It lets users index and retrieve content based on meaning rather than keywords, making it ideal for modern AI-based search applications. CocoIndex leverages vector embeddings and integrates with various models and frameworks, including OpenAI and Hugging Face, to provide high-quality semantic understanding. It’s built for transparency, ease of use, and local control over your search... -
11
Zvec
A lightweight, lightning-fast, in-process vector database
...Developed by Alibaba’s Tongyi Lab, it positions itself as the “SQLite of vector databases” by being easy to integrate, minimal in dependencies, and capable of handling high throughput with low latency on edge devices or small systems. Zvec excels at approximate nearest neighbor search and retrieval tasks that power features like semantic search, recommendation systems, and retrieval-augmented generation (RAG) setups. Its performance benchmarks show it achieving high queries-per-second and fast index build times compared to similar tools. Because it runs in-process, developers can embed it in native apps, microservices, or edge computing scenarios where traditional server-based vector databases might be overkill. -
12
Vald
Vald. A Highly Scalable Distributed Vector Search Engine
Vald is a highly scalable distributed fast approximate nearest neighbor dense vector search engine. Vald is designed and implemented based on the Cloud-Native architecture. It uses the fastest ANN Algorithm NGT to search for neighbors. Vald has automatic vector indexing and index backup, and horizontal scaling which is made for searching from billions of feature vector data. Vald is easy to use, feature-rich and highly customizable as you needed. -
13
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
14
ZeusDB Vector Database
Blazing-fast vector DB with similarity search and metadata filtering
ZeusDB is a vector database built for fast, scalable similarity search with strong production ergonomics. It combines high-performance approximate nearest neighbor indexes with clean APIs and metadata filtering so applications can retrieve semantically relevant items at low latency. The storage layer is designed for durability and growth, supporting sharding, replication, and background compaction while keeping query tails predictable. Developers get multiple ingestion paths—batch, streaming, and upsert—making it easy to keep embeddings synchronized as content changes. ... -
15
Faiss
Library for efficient similarity search and clustering dense vectors
Faiss is a library for efficient similarity search and clustering of dense vectors. It contains algorithms that search in sets of vectors of any size, up to ones that possibly do not fit in RAM. It also contains supporting code for evaluation and parameter tuning. Faiss is written in C++ with complete wrappers for Python/numpy. Some of the most useful algorithms are implemented on the GPU. It is developed by Facebook AI Research. Faiss contains several methods for similarity search. It... -
16
Machine learning basics
Plain python implementations of basic machine learning algorithms
...Instead of relying on external machine learning libraries, the algorithms are implemented from scratch so that users can explore the mathematical logic and computational structure behind each technique. The repository includes notebooks that demonstrate classic algorithms such as linear regression, logistic regression, k-nearest neighbors, decision trees, support vector machines, and clustering techniques. Each notebook typically combines explanatory text, Python code, and visualizations to illustrate how the algorithm operates and how it can be applied to datasets. -
17
Machine learning algorithms
Minimal and clean examples of machine learning algorithms
Machine learning algorithms is an open-source repository that provides minimal and clean implementations of machine learning algorithms written primarily in Python. The project focuses on demonstrating how fundamental machine learning methods work internally by implementing them from scratch rather than relying on high-level libraries. This approach allows learners to study the mathematical and algorithmic details behind widely used models in a transparent and readable way. The repository... -
18
NEtCAT NanoSurface Analyzer
NanoSurface Analyzertool is designed for the STM image analysis
NanoSurface Analyzer tool is designed for the analysis and measurement of surface data at the nanoscale. This application is developed to support researchers working with surface data by providing tools for reading, processing, and analyzing data. -
19
Voy
A WASM vector similarity search written in Rust
...It is designed to operate on embeddings generated from text or other data, allowing applications to perform meaning-based search rather than simple keyword matching. The engine uses efficient data structures such as k-d trees to index vectors and perform fast nearest-neighbor queries, making it suitable for real-time search experiences. One of its key advantages is its extremely small footprint, allowing it to be deployed easily on CDNs or client-side applications without significant overhead. Voy also supports serialization and deserialization of indexes, enabling developers to persist and transfer search data across environments. ... -
20
AnnLite
A fast embedded library for approximate nearest neighbor search
AnnLite is a lightweight and embeddable library for fast and filterable approximate nearest neighbor search (ANNS). It allows to search for nearest neighbors in a dataset of millions of points with a Pythonic API. A simple API is designed to be used with Python. It is easy to use and intuitive to set up to production. The library uses a highly optimized approximate nearest neighbor search algorithm (HNSW) to search for nearest neighbors. ... -
21
Annoy
Approximate Nearest Neighbors in C++/Python optimized for memory usage
Annoy (Approximate Nearest Neighbors Oh Yeah) is a C++ library with Python bindings to search for points in space that are close to a given query point. It also creates large read-only file-based data structures that are mmapped into memory so that many processes may share the same data. There are some other libraries to do nearest neighbor search. Annoy is almost as fast as the fastest libraries, (see below), but there is actually another feature that really sets Annoy apart: it has the ability to use static files as indexes. ... -
22
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. * More info + downloads: https://mlpack.org * Git repo: https://github.com/mlpack/mlpack
-
23
WaveTrain (Python)
Quantum dynamics of chain-like systems using tensor train formats
WaveTrain is an open-source software for numerical simulations of chain-like quantum systems with nearest-neighbor (NN) interactions only (with or without periodic boundary conditions). This Python package is centered around tensor train (TT, or matrix product) representations of quantum-mechanical Hamiltonian operators and (stationary or time-evolving) state vectors. WaveTrain builds on the Python tensor train toolbox scikit_tt, which provides efficient construction methods, storage schemes, as well as solvers for eigenvalue problems and linear differential equations in the TT format. ... -
24
Machine Learning Git Codebook
For extensive instructor led learning
...The project is designed as a self-paced learning resource that walks learners through the full data science workflow, including data preprocessing, exploratory analysis, feature engineering, and model development. It covers a wide range of machine learning techniques such as decision trees, clustering methods, nearest neighbor algorithms, anomaly detection, and probabilistic classifiers. The repository organizes these topics into sequential notebooks that explain theoretical concepts while allowing users to experiment directly with code. Many lessons emphasize hands-on exercises where learners analyze datasets, implement algorithms, and evaluate results through visualizations and statistical metrics. -
25
ManifoldLearning
Package for manifold learning and nonlinear dimensionality reduction
A Julia package for manifold learning and nonlinear dimensionality reduction. Most of the methods use k-nearest neighbors method for constructing local subspace representation. By default, neighbors are computed from a distance matrix of a dataset. This is not an efficient method, especially, for large datasets.
