Search - knn kd tree

Search - knn kd tree - List

[AI-NN-PR] KNN DL : 0: c++实现的KNN库:建立高维度的K-d tree,实现K邻域搜索，最小半径搜索-K-NN algorithm implementation. It supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions.
Date : 2025-07-06 Size : 610kb User : duckur
[Special Effects] flann-1.2-src DL : 0: 快速近似KNN库，是一个对于kd-tree的实现。可以用它实现特征向量的匹配。-Fast approximate KNN library, is one for the kd-tree implementation. You can use it to achieve the feature vector matching.
Date : 2025-07-06 Size : 271kb User :
[matlab] knnsearch DL : 0: 寻找测试样本的最近邻，可以有效的用于用于模式识别，信号处理-This is a small but efficient tool to perform K-nearest neighbor search, which has wide Science and Engineering applications, such as pattern recognition, data mining and signal processing. The code was initially implemented through vectorization. After discussions with John D Errico, I realized that my algorithm will suffer numerical accurancy problem for data with large values. Then, after trying several approaches, I found simple loops with JIT acceleration is the most efficient solution. Now, the performance of the code is comparable with kd-tree even the latter is coded in a mex file. The code is very simple, hence is also suitable for beginner to learn knn search.
Date : 2025-07-06 Size : 3kb User : 刘晓红
[.net] KDTreeKnn DL : 0: KD Tree KNN This source code implement KD Tree in C# This is for my research Performance very good Using Parralel proceessing
Date : 2025-07-06 Size : 134kb User : Cang
[Data structs] kd-tree DL : 0: knn搜索利用kd tree 查找最相邻的k个高维空间的点-knn kd-tree
Date : 2025-07-06 Size : 204kb User : zlc
[Other Databases] knn DL : 0: 这是一个小而有效的程序来执行的K -近邻搜索算法，此算法利用JIT 理论加速循环，比向量化有效解决了大量数据的精度问题。甚至比kd-tree效果要佳。 K-nearest neighbor search已经广泛应用在科学与工程上，比如模式识别，数据挖掘和信号处理。 -This is a small and effective procedures to implement the K- nearest neighbor search algorithm, this algorithm JIT theoretical acceleration cycle, than to quantify an effective solution to the large amounts of data accuracy problems. Even more than the effect of kd-tree to be good. K-nearest neighbor search has been widely used in science and engineering, such as pattern recognition, data mining and signal processing.
Date : 2025-07-06 Size : 3kb User : hxl
[Data structs] kd-Tree-On-KNN DL : 0: 利用K_D树数据结构实现K邻域搜索的算法代码-K_D tree data structure the K neighborhood search algorithm code
Date : 2025-07-06 Size : 2.51mb User : 叶冬荣
[Other] knn DL : 0: 实现构建k-d树并且实现k-d树上的最邻近查找算法-Build a kd-tree and kd tree nearest neighbor search algorithm
Date : 2025-07-06 Size : 2kb User : 汪小龙
[DataMining] knn DL : 0: KNN分类器的MATLAB代码，速度快效果好，适合初学者使用。-KNN search without using any gancy data structure, such as kd-tree. However, it is the fastest knn matlab implementation I ever found.
Date : 2025-07-06 Size : 2kb User : 赵子龙
[MPI] CUDA_KDtree DL : 1: 使用KDtree进行KNN计算的source code-kd tree KNN
Date : 2025-07-06 Size : 10kb User : mamingfei
[Other] knn-kdtree DL : 0: kd树，分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。K-D树是二进制空间分割树的特殊的情况。-KD tree, the data structure of K dimensional data space. It is mainly used in the search of key data in multidimensional space (such as range search and nearest neighbor search). K-D tree is a special case of binary space partitioning tree.
Date : 2025-07-06 Size : 4kb User : Christiana