搜索资源列表
EDIT_Distance
- 实现最小编辑距离算法,并给出完整的编辑过程,完整版源码,已调试通过-To achieve the minimum edit distance algorithm, and gives the complete editing process, full version of source code, has been debugging through the
ann_1.1.1_MS_Win32_bin
- ann 最小距离运算库 ann 可提高运算速度-ann ann ann ann ann ANN ann ann ann ann ann ann ann lib
oushijulifu
- 现代模式识别根据相似阈值和最小距离原则的简单聚类方法-Modern pattern recognition based on the similarity threshold values and the principles of a simple minimum distance clustering method
PR_SimpleClusteringP26
- 孙即祥:《现代模式识别》P.26:根据相似性阈值和最小距离原则的简单聚类方法MATLAB(另一种方法实现同一种算法)-SUN Xiang: " Modern pattern recognition" P.26: According to the similarity threshold and minimum distance principle of a simple clustering method MATLAB (another way to achieve the s
dijkstra
- 求解图中起点到任意一个点的最小距离 输出len 和 meth分别记录长度 和 父亲点-Solving the graph point of origin to any point of a minimum distance of the output record length len, and meth and father respectively, point
ordinary_algorithm_for_pattern_recognition
- 使用C语言实现的一些简单模式识别聚类算法,用于简单的二维坐标系点的聚类。有最短距离算法、K均值算法、近邻算法、fcm算法、最大最小距离算法。-Using the C language implementation of some simple pattern recognition clustering algorithm for a simple two-dimensional coordinate system point of clustering. Has the shortest di
Classifier_min_Local_Mean_f
- 局部最小距离分类器,性能高于knn分类器,matlab环境下,可直接调用-Local minimum distance classifier, classifier performance than knn, matlab environment, can be called directly
floyd
- 应该已经非常优化的floyd程序。简短、运行时间短、简单易理解。初学者亦可理解。实现任意两点间的最小距离和路径-Floyd should have a very optimized program. Short run time is short, simple and easy to understand. Beginners can understand. To achieve the minimum distance between any two points and path
matlabfun
- 信源函数 randerr 产生比特误差样本 randint 产生均匀分布的随机整数矩阵 randsrc 根据给定的数字表产生随机矩阵 wgn 产生高斯白噪声 信号分析函数 biterr 计算比特误差数和比特误差率 eyediagram 绘制眼图 scatterplot 绘制分布图 symerr 计算符号误差数和符号误差率 信源编码 compand mu律/A律 压缩/扩张 dpcmdeco DPCM(差分脉冲编码调制)解码 dpcmen
LargestMinimumClustering
- 最大最小距离聚类法,java实现。最大最小距离聚类法,java实现。-LargestMinimumClustering
xdx
- 本文介绍的是基于类内最小距离的人耳识别,利用图像处理上的一些基本的预处理和特征提取与类内最小距离比较来达到识别的目的,通过在VC环境下运用C++和OPENCV进行编程,观察实现的效果。-ear recognition Based on the minimum distance
BTree
- 定义二叉树两个结点的最小距离为这两个结点的最近公共祖先分别到这两个结点的路径长度之和。请设计一种方法,找出给定二叉树中任意两个结点的最小距离,可以考虑以图形显示之。程序实现二叉树的层次遍历,要求每层之间的数据用一个空格分开。二叉树采用二叉链表方式进行存储-Defined binary minimum distance of two nodes for these two nodes were the most recent common ancestor of these two nodes a
chengxu
- 本文中利用遗传算法求解的问题为最短路径,该问题可描述为:在某大学校园内有多个场所,各场所之间有一个相关的距离cij ,目标就是要寻找一条从指定的起点 s 到指定的终点 t 的一条路径,使总距离最小。-This paper the problem using genetic algorithm for the shortest path, the problem can be described as: a university campus in a number of places, the
number-recognition
- 基于最小距离的手写体数字的模式识别代码,vs2008编写-num recognition
kmeans-image-segmentation
- K-means算法是一种动态聚类方法,这种方法先选择若干样本作为聚类的中心,在按某种聚类准则(通常采用最小距离原则)使各种样本向各个中心积聚,从而得到初始的分类,然后,判断分类的合理性,如果不合理,就修改分类,如此反复的修改聚类的迭代运算,直到合理为止。-K-means algorithm is a dynamic clustering method, this method, select the number of samples as a cluster center in the clu
matlab
- 仿真程序:首先需要用一个随机发生器产生(0.1)内的均匀随机数,然后再将该序列映射到对应的幅度电平{Am}。然后将这个范围再分成4个相等的区间,这些子区间分别对应于4个信号比特的符号00,01,10,11。检测器观察到r=Am+n,并且计算r和4种可能传输的信号幅度之间的距离,它的输出Bm就是相应于最小距离的信号电平。Bm与真正的的传输信号幅度比较,差错计数器用来对检测器产生的差错计数。-Simulation program: first need to use a random genera
cities
- 简单小程序,点击设置城市,也可点击设置城市之间离,并求出两城市之间最小距离-Simple applet, click the Settings cities, between cities can be set to click away and find the minimum distance between two cities
numberbie
- 本程序实现了手写数字体的识别,识别算法采用最小欧氏距离法-Realized by the number of fonts handwriting recognition, recognition algorithms using the minimum Euclidean distance method
my_clustering
- 一种分层聚类算法,类内采用最大距离,类间采用最小距离实现-A hierarchical clustering algorithm, within the class with the maximum distance between the smallest distance class realize
Matlab-distanceleast
- 在对一组离散数据点进行拟合时,我们采用最小距离拟合来达到拟合的函数与原数据达到最优拟合-In a group of discrete data points to fit, we use minimum distance fit to achieve the fit function to achieve optimal fit with the original data