搜索资源列表
moshishibie
- 先用C-均值聚类算法程序，并用下列数据进行聚类分析。在确认编程正确后，采用蔡云龙书的附录B中表1的Iris数据进行聚类。然后使用近邻法的快速算法找出待分样本X（设X样本的4个分量x1=x2=x3=x4=6；子集数l=3）的最近邻节点和3-近邻节点及X与它们之间的距离。-First C-means clustering algorithm procedures and with the following data for cluster analysis. After confirming t
NearestFeatureLineClassifier
- 用于空中目标识别的最近特征线分类器子程序。-Aerial targets for the identification of Nearest Feature Line Classifier subroutine.
nearest_neighbors
- Nearest neighbors is a semi deconvolution algorithm. I m a newbie in matlab but I hope this helps somebody :)
nearestneighbour
- 国外人写的三维最近点查找程序，采用该程序可以很快找到距某一点或一组点最近的n个点。-Foreign people to write three-dimensional nearest point search procedure, the use of the program can be quickly found from a point or a group of points, the most recent n points.
BruteSearch
- K-nearest neighbors 搜索 聚类时经常使用的一种方法 国外网站转载- The following utilities are provided: - Nearest neighbor - K-Nearest neighbors - Radius Search They al supports N-dimensions and wor
lianbiao
- 实现链表的数据读入，查找，查找最近点等基本功能，适合于初次学习链表数据结构的学者。-The realization of the data read into the list, find, find the basic functions such as nearest point for the initial learning of the scholars list data structure.
fenglong07323206
- 一个菜单界面，分别用菜单命令来绘制原数据曲面图，线性插值，最近点插值，3次多项式插值，3次样条插值后的图形，每次插值都可以在同一图形界面下比较插值前后图形。-A menu interface, respectively, using the menu command to map the original data surface map, linear interpolation, nearest point interpolation, polynomial interpolation 3
Nearestpoint
- 求最近点对问题， 求最近点对问题。-Nearest point on the issue of demand, and the nearest point on the issue, and the nearest point on the issue.
PSO_Algorithm
- PSO’s precursor was a simulator of social behavior, that was used to visualize the movement of a birds’ flock. Several versions of the simulation model were developed, incorporating concepts such as nearest-neighbor velocity matching and accele
STANN
- STANN是轻量级的邻域搜索C++库, 在低维空间性能极为卓越, 特别是3D空间, 比ann-1.1.1好.-STANN is a lightweight thread-safe library for doing Nearest Neighbor searches. It is designed for low dimensional data sets, preferably 3d
Nearestpoint
- 最近点对算法的实现，用穷举法证明程序的正确性。-Nearest point of the algorithm, the exhaustive method to prove the correctness of the procedure.
Cpair
- 最近点对算法，穷举法证明算法的正确性，可供学习和参考-Nearest point of the algorithm, exhaustive method to prove the correctness of algorithms for learning and reference
select
- In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic.) This includes the cases of finding the minimum, maximum, and median elements. There are worst-
kNN
- It s the kNN or else named k-Nearest Neabours algorythm, realized by the tools of Visual Studio developer system.
Parzen
- 在这里输入需要翻实现parzen 库中找出与当前情况距离最近的样本的方法.把距离定义为相匹配的输入事例的特征加权和译的文字-Enter here the realization of the need to turn parzen library with the current situation to find the nearest sample. Defined as the distance to match the characteristics of the input-wei
HostBoot
- The evaluation software will be operational for a limited time only. Please contact your nearest IAR Systems office or IAR Systems distributor if you want to purchase the full version of the product (contact link found below).
K-meansNB
- ：将K—means算法引入到朴素贝叶斯分类研究中，提出一种基于K—means的朴素贝叶斯分类算法。首先用K— me．arks算法对原始数据集中的完整数据子集进行聚类，计算缺失数据子集中的每条记录与 个簇重心之间的相似度，把记 录赋给距离最近的一个簇，并用该簇相应的属性均值来填充记录的缺失值，然后用朴素贝叶斯分类算法对处理后的数据 集进行分类。实验结果表明，与朴素贝叶斯相比，基于K—means思想的朴素贝叶斯算法具有较高的分类准确率。-: K-means algorithm will
Yong
- Image thresholding has played an important role in image segmentation. In this paper, we present a novel spatially weighted fuzzy c-means (SWFCM) clustering algorithm for image thresholding. The algorithm is formulated by incorporating the spatial ne
OpenTSTOOL1_02
- 用于非线性时间序列分析的软件包。可用于计算：时间延迟重构，分形维数，互信息，Lyapunov指数，替代数据集，最近临点统计，回归时间，庞加莱截面，非线性预测-TSTOOL is a matlab software package for nonlinear time series analysis. TSTOOL can be used for computing: Time-delay reconstruction, Lyapunov exponents, Fractal dimensions