搜索资源列表
KNN_Classi192133852005
- k-nearest neighbors classifier
fknn
- KNN算法的实现，k-nearest neighbors聚类算法的matlab 实现
knn_matlab.rar
- knn—k近邻准则matlab实现，适合初学者,knn-k neighbors to achieve the criteria matlab
knn.kmeans.fisher
- 常用的分类方法，包括最近邻（NN），k均值（kmeans），k近邻，Fisher线性判别。-Commonly used classification methods, including nearest-neighbor (NN), k the mean (kmeans), k neighbors, Fisher linear discriminant.
KNN
- 数据挖掘导论中的K近邻聚类算法，用C++编写而成。-Introduction to Data Mining of the K neighbors clustering algorithm, using C++ has been prepared by.
nearest_neighbors
- Nearest neighbors is a semi deconvolution algorithm. I m a newbie in matlab but I hope this helps somebody :)
BruteSearch
- K-nearest neighbors 搜索 聚类时经常使用的一种方法 国外网站转载- The following utilities are provided: - Nearest neighbor - K-Nearest neighbors - Radius Search They al supports N-dimensions and wor
spectralclustering-1.0
- 一款功能强大的分类算法软件包，在matlab环境下使用。详见如下网站 http://mloss.org/software/view/133/-A MATLAB spectral clustering package to deal with large data sets. Our tool can handle large data sets (200,000 RCV1 data) on a 4GB memory general machine. Spectral clustering a
maugis
- 模拟退火和对称 *欧几里德旅行商问题。 * *为基础的解决办法的本地搜索启发式 *非过境道路和近邻 -/* * Simulated annealing and the Symetric * Euclidian Traveling Salesman Problem. * * Solution based on local search heuristics for * non-crossing paths and nearest neighbor
flann-1.2-src
- FLANN - Fast Library for Approximate Nearest neighbors This is a library for fast approximate nearest neighbor matching. -FLANN- Fast Library for Approximate Nearest neighbors This is a library for fast approximate nearest neighbor matching.
6
- Finding Nearest Neighbors in Replication-Aware CDN-P2P Architecture.pdf
GLTree2DFEX
- FAST K-NEAREST NEIGHBORS SEARCH -FAST K-NEAREST NEIGHBORS SEARCH Descr iption You can find the descr iption at: http://www.advancedmcode.org/gltree.html A Pro Version has been published on: http://www.advancedmcode.org/gltree-pr
ann_1.1.1
- ANN is a library written in the C++ programming language to support both exact and approximate nearest neighbor searching in spaces of various dimensions. It was implemented by David M. Mount of the University of Maryland, and Sunil Arya of the
classification
- classification algorithm. We use the genetic algorithm and a training data set to learn real-valued weights associated with individual attributes in the data set. We use the k nearest neighbors algorithm to classify new data records based on their we
Nearest
- K-Nearest Neighbors Algorithm
Kode-Program-Algoritma-Nearest-Neighbor
- In pattern recognition, the k-nearest neighbor algorithm (k-NN) is a method for classifying objects based on closest training examples in the feature space. k-NN is a type of instance-based learning, or lazy learning where the function is only approx
k-nearest
- FAST K-NEAREST NEIGHBORS SEARCH， Simple but very fast algorithm for nearest neighbors search in 2D space.
K---nearest-neighbour-classifier
- 采用快速K近邻与Kmeans聚类算法来计算前K个近邻，舍弃了一部分不可能成为待测样本的前K个近邻的训练样本，从而减少了计算量，提高了分类速度-Fast K-nearest neighbor Kmeans clustering algorithm to calculate the K nearest neighbors, abandoning the training samples of the part can not become the first K neighbors of the t
k-nearest-neighbors-with-incremental-distance-upd
- k-nearest-neighbors classification with incremental update of distance matrix
k-nearest-neighbors
- k最近邻法、有权重的k最近邻法及线性判别-K-nearest neighbor and linear discriminant analysis