Search Results for "k nearest neighbor java"
Sort By:
Showing 18 open source projects for "k nearest neighbor java"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
1
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,... -
2
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... -
3
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. ... -
4
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
-
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.
-
5
Point Symmetry Clustering
Point Symmetry Clustering Approach Using Differential Evolution
Implementation of Point Symmetry-based Automatic Clustering Approach Using Differential Evolution Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.) Used those academic works for algorithm implementation: http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf http://www.softcomputing.net/smca-paper1.pdf 1. ... -
6
libfastknn
Fast C++ KNN classifier
KNN Classifier library for C++, at background using armadillo. In k-NN classification, the output is a class membership. An object is classified by a majority vote of its neighbors, with the object being assigned to the class most common among its k nearest neighbors (k is a positive integer, typically small). If k = 1, then the object is simply assigned to the class of that single nearest neighbor. -
7
Spatial C++ Library
Library of generic, k-d tree multi-dimensional containers
...Additionally, Spatial's self-balancing kd-tree based containers, capable of object insertion and removal in fractional amortized time, prevent worst-case computational time on most operations. The latest release brings bug fixes and wide array of performance improvement across several algorithms. Nearest neighbor search, in particular, has been improved significantly. -
8
PolyRec
Unistroke gesture recognizer
NEWS: PolyRec is now on GitHub. Please visit https://github.com/cluelab/polyrec PolyRec is a unistroke gesture recognizer suitable for fast prototyping of gesture-based applications. The recognizer uses a nearest neighbor approach, and requires a small number of samples for each class. The similarity between two gestures is calculated through a three steps procedure: -firstly, each gesture is approximated to a polyline, in order to extract its main movements; - then, the two... -
9
RDP FrameBot is a frameshift correction and nearest neighbor classification tool for use with high-throughput amplicon sequencing. It uses a dynamic programming algorithm to align each query DNA sequence against a set of target protein sequences, produces frameshift-corrected protein and DNA sequences and an optimal global or local protein alignment. It also helps filter out non-target reads.
-
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
10
Fast Matrix for Java
General purpose matrix utilities for Java in Parallel Computing
Fast Matrix for Java (fm4j) is a general-purpose matrix utility library for computing with dense matrices. fm4j encapsulated different underlying implementations and select the optimal one in run-time depending on the size of the input matrix. Moreover, fm4j employs Java (Tm) Concurrency to take advantage of the computation power of multi-cor processors. -
11
JClassifier
Java data mining library and application
Java data mining library for multi-class one nearest neighbor classification and vector quantization by optimized dimension-wise hierarchical clustering to reduce data. The application can process LibSVM files. -
12
Sentence Composer
Compose the writings semi-automatically
Please click on "BROWSE ALL FILES" to open a README! What is this program? This program is meant to search the texts and suggest sentences that might follow any inputted sentence. It was meant to help composing the writings. How was it made? First, I made a chatterbot to understand the concept of "predicting" the next sentence (worked as good as the Cleverbot), then I made this program that is aided by an user to compose the new writings. SAMPLE: Input sentence was "Learning... -
13
tiny-AI Library
small and fast C++ library dealing with artificial intelligence
A fast artificial intelligence library which currently supports: kNN (k-Nearest Neighbor algorithm) MLP (Multilayer-Perceptron) -
14
Pronac MediaMonkey Extension
Recommends music based upon your current taste.
...Play the first song from the Now Playing list, it'll recommend you next songs from the same list. NOTE: MAKE SURE THAT SONG SHUFFLE IS TURNED OFF WHILE USING PRONAC. Based upon K-Nearest Neighbor Machine Learning Algorithm, K-Fold Cross Validation and EchoNest for audio features. -
15
gpufsknn
A GPU-based efficient data parallel formulation of the kNN problem
A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc. -
16
gaKnn(Genetic Algorithm Optimized K Nearest Neighbor Classification framework) is a frameowork for KNN optimization with a genetic algorithm. The genetic algothm used for this is JGAP (http://jgap.sourceforge.net/).
-
17
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
-
18
Salamis
An in-memory vector database written in C++
# Salamis Salamis is a small C++17 vector database prototype. It keeps vectors in memory for fast exact nearest-neighbor search and persists the collection to a physical binary store on disk. ## License Salamis is licensed under the GNU General Public License version 3.0 only. See [LICENSE](LICENSE) for the full license text. ## Features - In-memory vector map keyed by string ids - Physical binary backing file that reloads on startup - Exact `top-k` search with cosine similarity, L2 distance, or dot product - Cross-platform build and storage path handling for Linux and Windows - Snapshot writes through a temporary file followed by replacement - Dependency-free CMake build - Minimal CLI and unit tests - User and admin web consoles for distributed deployments - Management CLI for node inventory, shard ownership, and health checks ## Modules - `SalmisCore`: local in-memory vector store, search, and physical persistence - `SalmisCluster`: distributed shard own
- Previous
- You're on page 1
- Next