Nearest

This method produces different results depending on what city is choosen as the starting point.This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes.

This method produces different results depending on what city is choosen as the starting point.This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes. Requirements: - MATLAB 7.6 or higher

In this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.You want more? go to the Professional version of GLTreeIt has been designed for uniformly random data, where is the fastest I ever used, but works fine even on...


Platforms: Matlab

this file you can find a simple but very effective algorithm for Nearest Neighbour Search which I megalomaniacly called the GLTree.You want more? go to the Professional version of GLTreeIt has been designed for uniformly random data, where is the fastest I ever used, but works fine even on sparse...


Platforms: Matlab

This is the algorithm involved on the use of the non-linear forecast of asset's prices based on the nearest neighbour method.The basic idea of the NN algorithm is that the time series copies it's own past behavior, and such fact can be used for forecasting purposes. On the zip file there are two...


Platforms: Matlab

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


Platforms: Matlab

The solution of the nearest correlation matrix applies the hypershpere or spectral decomposition methods as outlined in Monte Carlo methods in Finance by Peter Jackel, Chapter 6.Use CorrelationExample.m that applies a simple example for the two cases.


Platforms: Matlab

Given a set of points in N-dimensional Euclidean space, works out for each point the distance to its nearest neighbour (unless its nearest neighbour isn't very close). The distance metric is a method; subclass and override it for non-Euclidean space. SYNOPSIS use...


Platforms: *nix

Free AVI Merger, It can merge VOB, AVI, WMV, ASF, MPEG2, MPEG, MP4, AVCHD, DAT, MOV, FLV, F4V, 3GP, 3G2 files to VCD, SVCD, DVD, MPEG1, MPEG2 file. It can use different resize mode. e.g. Bilinear, Bicubic, Custom Nearest.


Platforms: Windows

IntelligenceLab is a set of .NET 2.0-4.0 components for Artificial Intelligence. Includes: Neural networks, Naive Bayesian, Radial Basis Function Network, Self Organizing Map, K-Nearest Neighbor and more. Usage: Speech recognition, Face recognition, Computer vision, Gesture recognition, Robotics,...


Platforms: Windows

At the start of the game some pieces are set down in the horizontal row of squares, nearest each player. The pieces are divided into two matching sets, by convention called white and black. The players alternate moving one piece of their own at a time. Each piece moves according to specific rules...


Platforms: Windows

The k-means algorithm is widely used in a number applications like speech processing and image compression.This script implements the algorithm in a simple but general way. It performs four basic steps.1. Define k arbitrary prototypes from the data samples.2. Assign each sample to the nearest...


Platforms: Matlab

SC - Sparse ClassifierFSC - Fast Sparse ClassifierGSC - Group Sparse ClassifierFGSC - Fast Group Sparse ClassifierNSC - Nearest Subspace ClassifierRequires SPGL1 - http://www.cs.ubc.ca/labs/scl/spgl1/Requires Sparsify - http://www.see.ed.ac.uk/~tblumens/sparsify/sparsify.htmlRequires...


Platforms: Matlab

The 2-column vector contains cities' coordinates. The algorithm generates the optimal path to visit all the cities exactly once, and return to the starting city.The algorithm has its limitations, and based on the cities' distribution on the map it may or may not give the optimal solution.It...


Platforms: Matlab

GANSO is a programming library for global and nonsmooth, nonlinear optimization. Unlike local methods (e.g., quasi-Newton), global optimization methods aim at locating the absolute minimum of a function, not the nearest stationary point. GANSO toolbox provides an interface for calling GANSO...


Platforms: Matlab

Measures of Analysis of Time Series (MATS) toolkit computes a number of different measures of analysis of scalar time series (linear, nonlinear and other statistical measures). It also contains pre-processing tools (transformations and standardizations), data splitting facility, resampled data...


Platforms: Matlab

This is Markus Buehren's code re-packaged to work in Simulink. I use it with Global Nearest Neighbour data association method. Any problems with the actual algorithm should be addressed to Markus. Any problems with the Simulink port, please let me know. Thanks Markus.This file runs happily in the...


Platforms: Matlab

Fuzzy k-nearest neighbors classifier that can work with training samples whose label info is fuzzified. The prototype is as follows.[y,predict_class] = f_knn(tr,tr_memberships,te,k)tr: training samplestr_memberships: membership values of traning sampleste: testing samplesk: k value vector (more...


Platforms: Matlab

This functions uses GRIDDATA to interpolate pixel values from scatterred points on a head image. A reference image can be used to interactively select point locations from the 10/20 international system (EEG electrode position). Options for interpolation include linear and cubic and nearest. The...


Platforms: Matlab

When drawing financial time series from various markets, one usually needs to make some adjustments before evaluating the series. One of the major concerns is that due to different national holidays or working days across countries, the dates happen to be not synchronized. Clearly this could make...


Platforms: Matlab