搜索资源列表
cpair
- 本程序可以在输入n点后，判断出这n个点中距离最近的两个点-procedures in the importation of n point, the judge out of this n points from the nearest two points
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 randomly, or systematically as the f
KNN
- 数据挖掘导论中的K近邻聚类算法，用C++编写而成。-Introduction to Data Mining of the K neighbors clustering algorithm, using C++ has been prepared by.
LCS-VC60
- C语言DTW算法实现,主要功能: 1)快速近邻DTW比较 2)算法稳定 3)节省内存-== Key features == 1) Fast Dynamic Time Warping nearest neighbor cost retrieval. 2) Persistence 3) External-memory: you need only a constant amount of RAM
yy
- 给出一个非负小数，找出分子不超过M，分母不超过N的最简分数或整数， 使其最接近给出的小数。如果这个分数不唯一，输出‘TOO MANY’。 输入文件格式(closest.in) 第一行，M，N（1<=M,N<=10^9） 第二行，即小数R，(0<R 输出文件格式(closest.out) 仅一行，若解唯一输出 分子 / 分母(整数K写成K/1)，否则输出TOO MANY 样例输入： 360 120 3.1415926536
knn
- K-nearest neighbor classifier (k-NN) is a nonparametric approach for classification. It does not require the priori knowledge such as priori probabilities and the conditional probabilities. It operates directly towards the samples and is categorized
WordTest
- 本文阐述了一个基于K-Nearest Neighbor(KNN)算法的中文网页自动分类系统的体系结构、具体设计和实现过程。系统分成三个模块：中文网页的下载与过滤（王勋完成）；KNN算法的训练与分类（黄健完成）；算法评估以及分词系统的整合（吴亮完成）。 本人主要是实现算法的评估以及分词系统的整合：分词系统的整合利用爱博汉语分词系统(服务器版本—共享版)，将下载下来的中文网页过滤后所得到的txt文件内容进行分词，以便提供给KNN算法进行训练和分类；算法的评估是将KNN算法后所得到的结果进行分析，
Recognition
- Pattern recognition using the method of nearest neighbor. Building etalons.
lbimproved_2009-12-29
- C语言DTW算法实现,主要功能: 1)快速近邻DTW比较 2)算法稳定 3)节省内存-== Key features == 1) Fast Dynamic Time Warping nearest neighbor cost retrieval. 2) Persistence 3) External-memory: you need only a constant amount of RAM
BTSP-Nearest-Insert
- 瓶颈TSP的最近插入启发式方法,Delphi源码调试通过-Nearest Insert Algorithm for Bottle TSP
Approximation4TSP
- 三种解决TSP问题的近似算法的实现：最短链路法、最近插入法和最近邻居法-Approximation algorithm for the realization of three to solve the TSP: the shortest link, nearest insertion method and nearest neighbor
point
- 最近点对问题，采用分治法，编译通过，代码正确-Nearest point problem using the divide-and-conquer method, the compiler through correct code
DM_YeDan
- KNN(K最近邻)分类算法以及K-means(K均值)聚类算法是应用广泛的两种算法。本代码是在VS2010环境下，用 C++语言在基于KNN及K-means算法下，实现了对Iris数据集的分类与聚类。-KNN (K nearest neighbor) classification algorithm, as well as K-means (K mean) clustering algorithm is widely used two algorithms. The code VS2010 en
Zoom-in-and-outbyVCPP
- 最邻近插值和双线性插值对所给图像进行缩小和放大操作。限制于位图操作。-The nearest neighbor interpolation and bilinear interpolation to the image, zoom in and out of operation. Limited bitmap operations, can not be used for other types of files. Remember! Do not like do not spray....
littleworld
- NW小世界网络的构成原则为：从一个环状的规则网络开始，网络含有N个结点，每个结点向与它最近邻的K个结点连出K条边，并满足N>>K>>In(N)>>1。随后进行随机化加边，以概率p在随机选取的一对节点之间加上一条边。其中，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时，NW小世界模型本质上等同于WS小世界模型。 -NW constitu
1
- 利用K-L变换进行人脸识别。首先求得待辨识图像相对于训练集平均脸的差值图像，然后求得该图像在特征脸空间中的坐标，最后采用最近邻法对图像进行归类。-KL transform for face recognition. Obtain the first image to be identified image with respect to the difference between the average face of the training set, and then obtain the
fnn
- false nearest neighbor calculation on a signal as a chaotic indicator
wave read
- 输入一wav格式声音信号 输出对声音信号进行抽取并插值后的频谱图(源程序为8倍重采样)，并可使用play函数进行播放试听，如play(nearest),play(ori) 有ori原始音质、ups插值音质、downs抽取音质三种及以下五种重采样音质 重采样试听种类有nearest,linear,spline,pchip,cubic，插值算法详见interp1函数 可用过取消注释“高斯白噪声”、“高频噪声”对声音信号加入噪声-Wav format input-output
circle2
- 在二维平面上的n个点中，如何快速的找出最近的一对点，就是最近点对问题。-In the two-dimensional plane of n points, how to quickly find the nearest pair of points, that is, the nearest point on the issue.
Kode-Program-Algoritma-Nearest-Neighbor
- Kode Program Algoritma Nearest Neighbor