Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
AnyGantt JS Gantt Charts 8.1.0
PHP Scripts Mall Pvt Ltd 1.0.2
Bytescout PDF To HTML SDK 8.7.0.2980
JavaScript Framework Shield UI 1.7.34
Fortune Car Rental Script 3.4
Fortune Stackoverflow Clone 3.4
VintaSoft Imaging .NET SDK 8.6
wolfSSL 3.12.2
Bytescout BarCode Generator SDK 4.62.0.964
ThomasNet Clone Script 2.0
Easy Button & Menu Maker 5.0
Entrepreneur News Portal 1.6
Fortune Quibids Clone 3.4
Database Workbench Pro 5.3.4
Extensibility Studio 2.0
Top Code
fastLogin 1.III
Face Detection & Recognition System 1.0
Chess Master 1.0
Nonlinear F-16 Fighter Model 1.0
efax 0.9
FJSP Software 1.0
College Management System Script 1.0.4
ZLPORTIO Library 1.50
Advanced Installer For Java 1.IV
Extreme Injector 3.7
Circle on image 1.0
ChequePRO Cheque Printing writing System 1.0
Extended HTML 0.1
Simple Menu Code 1.1
Vehicle Maintenance System 1.0
Top Rated
Output Messenger - company chat software 1.7.6
Indiegogo Clone 3.0
PHP Image Resize Script 1.0
Jango Clone Script 1.0
Best Spotify Clone 1.0
Get Random Record Based on Weight 1.0.0
Travel Portal Script 9.29
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Readymade MLM Products 2.01
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Efficient K-Nearest Neighbor Search using JIT 1.0
File ID: 82781






Efficient K-Nearest Neighbor Search using JIT 1.0
Download Efficient K-Nearest Neighbor Search using JIT 1.0http://www.mathworks.comReport Error Link
License: Shareware
File Size: 10.0 KB
Downloads: 275
Submit Rating:
Efficient K-Nearest Neighbor Search using JIT 1.0 Description
Description: 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.

License: Shareware

Related: approaches, Found, Simple, values, numerical, accurancy, Problem

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 275



More Similar Code

This is just a brute force implementation of k nearest neighbor search without using any fancy data structure, such as kd-tree. However it is the fastest knn matlab implementation I can find.

A partial sort mex function is implemented which is a simple wrapper of c++ partial_sort.

Provided the sort function, the matlab code is only of two lines. However, it is extremely fast.

install:
build;



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.



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.



This implementation includes modules for radiometric enhancement of colored 3D point clouds and nearest neighbor search. The introduced method detects the overlapping parts and derives a transformation function that reduces radiometric...



A fast artificial intelligence library which currently supports:
kNN (k-Nearest Neighbor algorithm)
MLP (Multilayer-Perceptron)



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/).



Delphi/C++ Builder VCL and FireMonkey (FMX) components library for very fast Artificial Intelligence.

Some of the components now also include a GP GPU support.

Also includes Visual Graphical Editor for Codeless Development...



ntelligenceLab is a set of .NET 2.0-4.5 components for Artificial Intelligence.

Also includes a visual graphical editor for codeless development.

Contains:

- Neural Network - Feed forward Neural Network...



IntelligenceLab VC++ is a set of Visual C++ components for Artificial Intelligence.
Includes: Neural networks, Naive Bayesian, Radial Basis Function Network, Self Organizing Map, K-Nearest Neighbor and more.
Usage: Speech recognition,...



This implements a KDTree for nearest neighbor and range searching.The KDTree stores a N-dimensional set of points. The tree can be queried for all points within a Euclidian range in order O(sqrt(p)+k) time, where p is the number of points and k is...

User Review for Efficient K-Nearest Neighbor Search using JIT
- required fields
     

Please enter text on the image