当前位置：
首页 资源下载
搜索资源 - Euclidean distance
搜索资源列表
-
0下载：
近邻分类，属于模式识别类的。对两类数据分别产生高斯分布数据，用KNN算法看这个数属于哪个类的，并求测试数据和类中每个数据的欧氏距离-Neighbor classification, pattern recognition belongs to the class. Two types of data were generated Gaussian distribution data, to see with this number belongs KNN algorithm class and
-
-
0下载：
利用欧氏距离测试ar人脸数据库，该处的数据库经过了PCA降维处理；
训练样本为共计100个人的700幅图像降维数据
仅供参考，和交流之用。 - by using Euclidean distance test of AR face database, the database through the PCA dimension reduction
training sample reduction data for 700 images of 100 individua
-
-
0下载：
本程序用于基因数据的分类，我自己写了一个基于欧氏距离的费舍尔判据，选取有代表性的基因，最后用NMF将矩阵分解，对得到的矩阵进行分类，分类用的是自带的svm算法-It is used for classfication, I wrote a fisher criterion based on Euclidean distance, selecting representative genes,after NMF,classification with the SVM algorithm is sh
-
-
0下载：
一个简单的knn算法程序，核心算法是基于欧几里得距离，程序在vs2010上调试运行，一点问题都没有，其他环境不知道-A simple knn algorithm program, the core algorithm is based on the Euclidean distance, program debugging run on vs2010, no problem at all, other environments do not know.
-
-
0下载：
In mathematics, the Euclidean distance or Euclidean metric is the ordinary distance between two points that one would measure with a ruler, and is given by the Pythagorean formula. -In mathematics, the Euclidean distance or Euclidean metric is the o
-
-
0下载：
基于欧式距离的KNN分类方法,本代码只适用于将数据分为三类。类数更多或更少需要简单的调整。-KNN classification method based on Euclidean distance
-
-
0下载：
实现了KNN文本的分类，KNN最近邻基于欧几里德距离的JAVA算法实现适用于初级学习KNN的初学者。-Realization of KNN text classification, KNN nearest neighbor JAVA algorithm for Euclidean distance implementation is applied to the primary learning KNN beginners based on.
-
-
0下载：
实现了KNN文本的分类，KNN最近邻基于欧几里德距离的JAVA算法实现适用于初级学习KNN的初学者。-Realization of KNN text classification, KNN nearest neighbor JAVA algorithm for Euclidean distance implementation is applied to the primary learning KNN beginners based on.
-
-
0下载：
Fuzzy c-means clustering (FCM) with spatial constraints (FCM_S) is an
effective algorithm suitable for image segmentation. Its effectiveness contributes not
only to introduction of fuzziness for belongingness of each pixel but also to
exploitat
-
-
0下载：
用于运动捕获数据所读取文件的转换，最终得到欧氏距离的数据-Motion capture data for converting files to read, and ultimately get the data Euclidean distance
-
-
0下载：
In this work, the Mel frequency Cepstrum Coefficient
(MFCC) feature has been used for designing a text
dependent speaker identification system. The extracted
speech features (MFCC’s) of a speaker are quantized to a
number of centroids using v
-
-
1下载：
计算矩阵内空间任意两点之间或者两个矩阵之间的欧式距离的代码。-The space between any two points is calculated matrix code or Euclidean distance between the two matrices.
-
-
0下载：
In point set analysis, it is useful to compare 2 sets of points by computing the distance between each possible point pair. For example, this is a required step in the ICP point set registration algorithm. MATLAB s built in function for computing the
-
-
0下载：
Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory
clustering are mainly based on density and Euclidean distance measures. We argue that when the utility of spatial clustering of
-
-
0下载：
自己编写的最近邻KNN算法，采用的距离是欧氏距离，附加了详细的中文注释，还有一个测试集和一个训练集-
I have written KNN nearest neighbor algorithm, the distance is the Euclidean distance, additional detailed notes in Chinese, as well as a test set and a training set
-
-
0下载：
计算任意两点间的欧式距离,结果保存为excel格式-calculate the Euclidean distance between any two points,saved as the form of excel
-
-
0下载：
RBF神经网络：rbf原理：所谓径向基函数(Radial Basis Function 简称 RBF），就是某种沿径向对称的标量函数。通常定义为空间中任一点x到某一中心xc之间欧氏距离的单调函数，可记作 k(||x-xc||），其作用往往是局部的，即当x远离xc时函数取值很小。最常用的径向基函数是高斯核函数，形式为 k(||x-xc||)=exp{- ||x-xc||^2/（2*σ）^2） } 其中xc为核函数中心，σ为函数的宽度参数，控制了函数的径向作用范围。在RBF网络中，这两个参数往往是可
-
-
0下载：
k最近邻算法，给出训练样本和测试样本，通过样本间欧氏距离或是绝对距离来寻找测试样本的k个近邻，并根据k个实例里多数所属的类将该测试样本归为该类。-k-nearest neighbor algorithm, given the training and testing samples by the Euclidean distance between the samples or the absolute distance to find the k nearest neighbors of th
-
-
0下载：
Fast calculation of squared Euclidean distance
-
-
0下载：
需要在一个N × M的网格中建立一个通讯基站，通讯基站仅必须建立在格点上。
网格中有A个用户，每个用户的通讯代价是用户到基站欧几里得距离的平方。
网格中还有B个通讯公司，维护基站的代价是基站到最近的一个通讯公司的路程（路程定义为曼哈顿距离）。
在网格中建立基站的总代价是用户通讯代价的总和加上维护基站的代价，最小总代价。-The need to establish a communications base in an N × M grid, communicatio
-
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
50
»
