euclidean-distance 话题在 GitHub 上没有填写简介，这里按 Star 数汇总最相关的热门仓库。
Production-ready K-Means clustering for Apache Spark with pluggable Bregman divergences (KL, Itakura-Saito, L1, etc). 6 algorithms, 740 tests, cross-version persistence. Drop-in replacement for MLlib with mathematically correct distance functions for probability distributions, spectral data, and count data.
Euclidean distance & signed distance transform for multi-label 3D anisotropic images using marching parabolas.
A small-scale flask server facial recognition system, using a pre-trained facenet model with real-time web camera face recognition functionality, and a pre-trained Multi-Task Cascading Convolutional Neural Network (MTCNN) for face detection and cropping.
统计分析课程实验作业/包含《统计分析方法》中因子分析，主成分分析，Kmeans聚类等典型算法的手写实现
Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.
The DaiSy Library for Fast and Exact, Data Series and Vector Similarity Search
This is the official code for 'Squeeze Every Bit of Insight: Leveraging Few-shot Models with a Compact Support Set for Domain Transfer in Object Detection from Pineapple Fields' and 'Simple Object Detection Framework without Training' project.
This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the experimental framework to compare them from a research paper published in PVLDB 2016. You can use it to add new methods and/or queries or reproduce our experimental results.
Eight Puzzle solver using BFS, DFS & A* search algorithms
Python 3 library for Multi-Criteria Decision Analysis based on distance metrics, providing twenty different distance metrics.
A Java console application that implements the factionality of the knn algorithm to find the similarity between a new user with only a few non zero ratings of some locations, find the k nearest neighbors through similarity score and then predict the ratings of the new user for the non rated locations.
Aldous is a zero-shot semantic telemetry engine that measures emotional valence purely through geometry. Bypassing generative AI, it evaluates text against multivariate Gaussian concepts in constant O(1) time. Features Latent Concept Erasure for transparent, mathematically verifiable safety guardrails.
Code repository for Adult Social Care Overview
Hand Segmentation and Finger Counting with Convex Hull
Allows for calculation of many types of distance between points
Clustered customers into distinct groups based on similarity among demographical and geographical parameters. Applied PCA to dispose insignificant and multi correlated variances. Defined optimal number of clusters for K-Means algorithm. Used Euclidian distance as a measure between centroids.
This repository contains a Python implementation of a K-Nearest Neighbors (KNN) classifier from scratch. It's applied to the "BankNote_Authentication" dataset, which consists of four features (variance, skew, curtosis, and entropy) and a class attribute indicating whether a banknote is real or forged.
Graphql API to recommend tourist sites based on user search criteria using the Euclidean distance algorithm.
The N-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The puzzle can be of any size, with the most common sizes being 3x3 and 4x4. The objective of the puzzle is to rearrange the tiles to form a specific pattern.
This Jupyter notebook demonstrates image segmentation using Lazy Snapping and K-Means Clustering. It showcases how these algorithms can partition an image into segments based on pixel intensity and user-defined masks.