搜索资源列表
ren-gong-zhi-neng
- 用c语言编的几个人工智能程序，包括蚁群算法，k最近邻, hebb学习, Hopfield 网络, 后向传播网络。-Artificial intelligence inside the c program, ant colony algorithm and k nearest neighbor, hebb study, the Hopfield network, back propagation network.
philbinj-fastann-cbf02be
- 近似最近邻多维向量快速匹配算法，使用随机k-d树-FASTANN: A library for fast approximate nearest neighbours
KNN
- K最近邻C实现，测试通过，可以使用，主要适用于数据库定位方法-K nearest neighbor C implementation, the test passes, you can use, mainly applied to the database location method
Semi-supervised-learning
- 义了一个欧氏距离和监督信息相混合的新的最近邻计算函数，从而将K一均值算法很好地应用于半 监督聚类问题。针对K一均值算法初始质心敏感的缺陷，用粒子群算法的搜索空间模拟聚类的欧氏空间，迭代搜 索找到较优的聚类质心，同时提出动态管理种群的策略以提高粒子群算法搜索效率。算法在UCI的多个数据集 上测试都得到了较好的聚类准确率。-Righteousness of a Euclidean distance and supervision of a mixture of new nearest n
location
- 室内定位算法，最近邻算法，K最近邻算法，加权K最近邻算法，贝叶斯算法-indoor position locatian ,including nn,knn,wknn,bayes.the algrithm compare the different of the above method and get some useful conclusion.
pattern1_a
- . PCA人脸识别 A．闭集测试。用每个人的前5张图像作为训练，剩下的5张图像作为测试。也就是说总共有200张训练图像和200张测试图像。采用最近邻分类，分析选取不同的主分量个数K，对识别率的影响 -. PCA Face Recognition A. Closed set tests. With each of the first five images for training, the remaining 5 images as a test. That is a total of
knnClassification
- 十大经典人工智能算法之一——K最近邻Matlab实现-One of the top ten classical artificial intelligence algorithms- K nearest neighbor Matlab implementation
Myknn
- KNN邻近算法,程序运行结果显示所有样本以及其类别，待分类样本所属的类（{1,18,11,11,0.5513196}属于"2"类），以及它的5个最近邻的类别和与它之间的距离。内有详细说明文档。-k-Nearest Neighbor algorithm
question5
- 通过fisher进行降维，然后通过最近邻进行分类。fisher通过两种不同方式进行降维。-using fisher to decrease the dimension of feature. then use k nearest to classifycation.
KL_SVD_face_recognition
- PCA主成分分析，采用KL投影和SVD分解提取人脸特征向量，最后采用最近邻判别法计算识别率。-Face recognition based on PCA. KL projection and SVD are used to extract face eigenvectors. Recognition rate is calculated by k nearest neighbors(KNN) method.
NN1akNN
- 实现机器学习中的最近邻算法——1-NN和k--Realization of machine learning algorithms 1-NN nearest neighbor and k-NN
KNN
- 自己实现机器学习十大算法中的k最近邻算法，经过测试，算法运行很好-Own machine learning algorithm to achieve the k nearest neighbor algorithm, tested, the algorithm runs very well
KNN-python
- 邻近算法，或者说K最近邻分类算法是数据挖掘分类技术中最简单的方法之一，给出一个实例，可直接运行- U90BB u8B1 u7B97 u7B97 u7C97 u6c2 U6700 u7B80 u5355 u7684 u65B9 u6CD5 u4E4B u4E00 uFF0C u7ED9 u51FA u4E00 u4E2A u5B9E u4F8B uFF0C u53EF u76F4 u63A5 u8FD0 u884C
knn
- 邻近算法，或者说K最近邻(kNN，k-NearestNeighbor)分类算法是数据挖掘分类技术中最简单的方法之一。所谓K最近邻，就是k个最近的邻居的意思，说的是每个样本都可以用它最接近的k个邻居来代表。(Neighborhood algorithm, or K nearest neighbor (kNN, k-NearestNeighbor) classification algorithm is one of the simplest methods in data mining class
KNN
- 最近邻学习算法，Python实现，最近邻规则分类(steps: In order to determine the unknown instance categories, with examples of all known categories as reference Parameter selection of K The calculation examples and all known examples of the unknown distance Choose the
MachineLearning-master
- 机器学习算法，包括knn等，K最近邻(kNN，k-NearestNeighbor)分类算法是数据挖掘分类技术中最简单的方法之一。(machine learning algorithm)
knn
- k最近邻算法:分类和回归。通过对训练集分类训练模型，验证集用于验证数据的准确性。(K nearest neighbor algorithm: classification and regression. Through the training set classification training model, the verification set is used to verify the accuracy of the data.)
kNN
- knn分类器, 机器学习实战第二章代码，k最近邻分类，适用于低维数据的分类器(classifier (KNN algorithm))