搜索资源列表
disteusq
- 声音处理的MATLAB程序：DISTEUSQ -calculate euclidean, squared euclidean or mahanalobis distance
New-Text-Document
- The program RANDOM_WALK_2D_PLOT plots the trajectories of one or more random walks. The program RANDOM_WALK_2D_SIMULATION plots averaged data for any number of random walks that each use the same number of steps. The data plotted is the average
point
- 用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方-Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity)
CH3Clustering
- 基于k-means的聚类编程，例如：随机选取k个中心点，经过计算每个点到k个中心距离的远近，将其归类。最后总的距离平方差最小，即停止。-Programmed based on k-means clustering, for example: randomly select k central point has been calculated for each point to the k center distances, will be classified. The final total
flower
- 对花卉的数据集分别通过“五折法”、随机产生训练样本、欧式平方距离、绝对值距离、契比雪夫距离和马氏距离进行数据集的识别。-Data sets, respectively, for flowers through the " half of Law" , randomly generated training samples, European squared distance, absolute distance, Chebyshev distance and Mahalanobi
K-means-clustering-algorithm
- K均值算法使用的聚类准则函数的误差平方和准则，通过反复迭代优化聚类结果，使所有样本到各自所属类别的中心的距离平方和达到最小。-K-means clustering algorithm uses squared error criterion function and criteria through iterative optimization clustering result, all the samples to the respective classes of the center s
fastdist.m
- Fast calculation of squared Euclidean distance
LGD_source_code
- For encoding, image is split in blocks and each block is then converted to the training vector Xi = (xi1, xi2, ..….., xik ). The codebook is searched for the nearest codevector Cmin by computing squared Euclidean distance as presented in equa
statistics_kmeans
- K-means算法是一种硬聚类算法，根据数据到聚类中心的某种距离来作为判别该数据所属类别。K-means算法以距离作为相似度测度。(kmeans uses the k-means++ algorithm for centroid initialization and squared Euclidean distance by default. It is good practice to search for lower, local minima by setting the 'Replica
noma
- NOMA corrected: farther away from Base Station (BS), more allocated power; % Assuming the Base Station (BS) has total power of 1 and will allocate % power for each User as proportional to squared distance: Pwr ~ Dst^2