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
Rapid PHP 2018 15.5
IBDAC 6.4
Online Course Booking Script 1.3.3
Database Workbench Pro 5.6.4
Job Portal Script 1.3.2
The C# PDF Library 5.2
PostgreSQL Data Access Components 6.0
Virtual Data Access Components 11.0
HTMLPad 2018 15.5
WeBuilder 2018 15.5
SentiMask SDK Trial 2.0.0
Track Order For Magento 2 1.0.0
Calendar 365 For Dynamics CRM 4.0
Scimbo 1.2
Odoo Furnito Theme 1.0
Top Code
Hotel Management System Restaurant Version 5.25
Azizi search engine script PHP 4.1.10
Travel Booking script 1.0.4
Chessgra 1.1
Keno Game 1.I
VChess 6.x-1.x-dev
Killer Guestbook Script 1.1
RLS Algorithm Demo 1.0
PHP MLM Software 2.0.1
College Management System Script 1.0.4
Spider(rader) Chart for Multi Data 1.0
Simple Radar_system_simulation 1.0
The Spherical K-means algorithm 1.0
Discrete Frechet Distance 1.0
AJ Matrix v2.6
Top Rated
VisualNEO Web 2018.12.15
Azizi search engine script PHP 4.1.10
Paste phpSoftPro 1.4.1
Extreme Injector 3.7
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Invoice Manager by PHPJabbers 3.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH 1.0
File ID: 80105






K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH 1.0
Download K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH 1.0http://www.advancedmcode.org/poker-predictor-a-free-texas-holdem-odds-and-probability-computer.htmlReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 15
Submit Rating:
K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH 1.0 Description
Description: When the dataset is small, when you have to run only a few number of search, or when the dimensions of points is large, the brute search method is still faster than kd-trees data structure. Computing the distances one by one take a minor time than building the tree.
Some of this problems have became less gravous since the introduction of GLTree (file id 22190) which allows for a very fast tree construction.
Despite this, very small dataset are still terrain for brute search algorithms.

I saw many k-neighbours utilities on FEX, but all them were m-coded. I think such a brute calculation is not an m-code job. So I developed my own Nearest Neighbour finder. It is nothing special it just computes all the distances and take the ones required from the input parameters, but of course the mex implementation make it even faster than vectorized m-code.

License: Freeware

Related: 22190 which, algorithmsi, all the, which allows for, when you have, Dataset, Dimensions, all them, allows for, brute calculation, brute search, became less, are still, mcode, and take, small dataset, fast tree, Distances, input parameters

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

File Size: 10.0 KB

Downloads: 15



More Similar Code

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 the number of reported points. A nearest neighbor search can be done in order O(log(p) time. The m-files are binary MATLAB functions written in C++. Source code is included as well as binaries for...



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



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



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 is an application of the Greedy Algorithm and the Local Search for finding a solution for the SC Distribution Network problem.
We dealt with one level SC composed of a set of factories and a set of Sales Points, each sales point has a...



Christmas wishlist and gift registry allows family and friends to search the list and to mark items purchased to prevent multiple same items being purchased.

It is written in PHP with a MySQL backend. It requires apache, php, and mysql.



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.



You have to give it the coordinates of the ends, number of coils, natural length and radius and it gives to you the (xs,ys) coordinates of the spring points, ready to use it with plot().
The picture shows an instant image of an animation of...



Christmas wishlist and gift registry allows family and friends to search the list and to mark items purchased to prevent multiple same items being purchased.

It is written in PHP with a MySQL backend. It requires apache, php, and mysql.

User Review for K-NEAREST NEIGHBOURS AND RADIUS (RANGE) SEARCH
- required fields
     

Please enter text on the image