搜索资源列表
PRAssign
- 脱机手写体识别Matlab源程序 包括特征提取、bayes分类器、K近邻分类及最近邻分类。 Testscr iptRecognition.m：测试代码 scr iptFeaExtract.m ：特征提取 KNearestEstimate.m ：K近邻估计 NearestEstimate.m : 最近邻估计 BayesTrain.m ：训练bayes分类器 Bayes.m ：测试bayes分类器 Cr
icp
- 迭代最近点算法的matlab源码，可以实现对3维点数据的对齐-Iterative nearest point algorithm matlab source code, you can realize 3-dimensional data on the alignment
K-meanCluster
- How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples random
NN3
- 主要是KNN（the k-nearest neighbor algorithm ）,LVQ1（learning vector quantization 1）, DSM（decision surface mapping）算法。 and a simple clustering algorithm.-Mainly KNN (the k-nearest neighbor algorithm), LVQ1 (learning vector q
MLkNN
- 数据挖掘领域中的一种算法－ML-KNN是一种改进的最近邻算法-Data Mining in the area of an algorithm-ML-KNN is an improved nearest neighbor algorithm
knn
- 朴素贝叶斯(Naive Bayes, NB)算法是机器学习领域中常用的一种基于概率的分类算法，非常简单有效。k近邻法(k-Nearest Neighbor, kNN)[30,31]又称为基于实例(Example-based, Instance-bases)的算法，其基本思想相当直观：Rocchio法来源于信息检索系统，后来最早由Hull在1994年应用于分类[74]，从那以后，Rocchio方法就在文本分类中广泛应用起来。-Naive
billiner
- 一个用matlab编写的最近邻插值法求图像的范大于缩小的小程序-Matlab prepared using a nearest neighbor interpolation for images larger than narrow the scope of small programs
LearningPatternClassificationASurvey
- 模式识别学习综述.该论文的英文参考文献为303篇.很有可读价值.Abstract— Classical and recent results in statistical pattern recognition and learning theory are reviewed in a two-class pattern classification setting. This basic model best illustra
Nearest_Neighbour_Algorithm_for_Stock_Prices_Forec
- 基于最近邻算法的股票价格预测matlab代码，很不错的-Nearest neighbor algorithm based on stock price prediction matlab code, very good
ANN
- ANN是一个加快搜索速度的源码程序；通过C++编写，支持在任意高维空间的近似或准确的最近邻搜索。-ANN is a source to speed up the search speed of procedures through C++ Prepared to support the arbitrary high-dimensional space approximate or accurate nearest neighbor s
knn
- k nearest neiborhood in macine learning
KNN
- k最近邻分类算法：用C++实现KNN分类-k Nearest Neighbor Classification Algorithm: The C++ realize KNN classification
ConquerandDiveTest
- 利用分治的算法实现平面最近点问题，有具体算法编程，另有界面演示。-The use of sub-rule algorithm planar nearest point problem, have specific programming algorithm, and another demonstration of the interface.
b
- 核子空间样本选择方法的核最近邻凸包分类器，不需要账号就可以下载-Nuclear space sample selection methods nuclear convex hull nearest neighbor classifier, no account can download
ann
- ANN is a library written in the C++ programming language to support both exact and approximate nearest neighbor searching in spaces of various dimensions. 可以直接用于工程 支持 Kd tree，BBF(best bin first) -ANN is a library writt
events
- * acousticfeatures.m: Matlab scr ipt to generate training and testing files from event timeseries. * afm_mlpatterngen.m: Matlab scr ipt to extract feature information from acoustic event timeseries. * extractevents.m
visKDTree
- kdtree. 用于最近点搜索。 可输入点的三维坐标，再输入查询点，即可得到指定的最近点坐标。-kdtree. english for nearest point. Can input three-dimensional coordinates, and then enter a query point can be specified by coordinates of the nearest point.
KNN
- KNN最近邻分类器和预测器，数据挖掘课程上的作业-KNN nearest neighbor classifier and prediction, data mining courses on the operation
find_nearest_neighbours
- ％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist ) ％ Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法，在非线性时间序列中很有用，是常用的算法- [Nearest_neighbours] = find_nearest_n
ann_1.1.1
- The approximate nearest neighbor search code is contained in this zip file. You can use the data contained in to see how the program works.