Welcome![Sign In][Sign Up]
Location:
Search - K-medoid

Search list

[matlabMyKmeans

Description: 实现聚类K均值算法: K均值算法:给定类的个数K,将n个对象分到K个类中去,使得类内对象之间的相似性最大,而类之间的相似性最小。 缺点:产生类的大小相差不会很大,对于脏数据很敏感。 改进的算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。-achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or)
Platform: | Size: 1024 | Author: 阿兜 | Hits:

[AI-NN-PRClusterdemos-src

Description: 一个k-means算法的改进。使用了模糊聚类的方法,并且有演示过程。-a k-means algorithm improvements. The use of fuzzy clustering method, and a demonstration of the process.
Platform: | Size: 59392 | Author: 付亮 | Hits:

[transportation applicationsksp-1.0.tar

Description: K条路 算法 计算最短路径 CVC8-K road shortest path algorithm CVC8
Platform: | Size: 12288 | Author: errantry | Hits:

[Algorithmmedoids

Description: 一个完整的以类的形式的k-medoids算法-to a complete category in the form of k-medoids algorithm
Platform: | Size: 1024 | Author: 小朱 | Hits:

[Special Effectskmedfilter

Description: K近邻中值(均值)滤波器 1) 以待处理像素为中心,作一个m*m的作用模板。 2) 在模板中,选择K个与待处理像素的灰度差为最小的像素。 3) 将这K个像素的灰度均值(中值)替换掉原来的像素值。 -K-nearest neighbor median (mean) a filter) for the pixel to be addressed, for a m* m role template. 2) In the template, select and K-pending pixel gray worse for the smallest pixels. 3) this K-pixel gray average (median) replace the original pixel.
Platform: | Size: 1024 | Author: 上官云 | Hits:

[Data structsk_way

Description: K路归并算法,用贪心算法构造霍夫曼树,采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern
Platform: | Size: 3072 | Author: taolizao | Hits:

[matlabK-C

Description: 这是一个K中心点聚类算法C实现的,希望对大家有用-K this is a clustering algorithm C to achieve a focal point, and I hope useful for everyone
Platform: | Size: 2048 | Author: 黎艺行 | Hits:

[Windows Developk-median

Description: 这是一个关于k中心聚类的算法,希望大家指点。-It is a clustering algorithm k centers, I hope everyone pointing.
Platform: | Size: 593920 | Author: fanliutong | Hits:

[Mathimatics-Numerical algorithmsk-means

Description: 用MFC开发的简单的k-means实现代码,原创啊-Using MFC to develop a simple realization of the k-means code, original ah
Platform: | Size: 2048 | Author: 李谦 | Hits:

[AlgorithmR-K-F

Description: 较著名的解初值微分方程的数值方法——自适应Runge-Kutta-Fehlberg算法-More well-known solutions of initial value differential equations numerical methods- adaptive Runge-Kutta-Fehlberg algorithm
Platform: | Size: 1024 | Author: 田建飞 | Hits:

[Windows Developk_Mean

Description: K聚类分析,通过使用欧式距离,K聚类方法显示聚类结果,用于分类-K cluster analysis, using Euclidean distance, K show the clustering results of clustering method for classification
Platform: | Size: 21504 | Author: 谢天培 | Hits:

[matlabcskmeans

Description: cskmeans 聚类算法的一种 1. 分裂法(partitioning methods):给定一个有N个元组或者纪录的数据集,分裂法将构造K个分组,每一个分组就代表一个聚类,K<N。而且这K个分组满足下列条件:(1) 每一个分组至少包含一个数据纪录;(2)每一个数据纪录属于且仅属于一个分组(注意:这个要求在某些模糊聚类算法中可以放宽);对于给定的K,算法首先给出一个初始的分组方法,以后通过反复迭代的方法改变分组,使得每一次改进之后的分组方案都较前一次好,而所谓好的标准就是:同一分组中的记录越近越好,而不同分组中的纪录越远越好。使用这个基本思想的算法有:K-MEANS算法、K-MEDOIDS算法、CLARANS算法;
Platform: | Size: 1024 | Author: lance | Hits:

[matlabk_medoids

Description: 聚类算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。 这里是MAtlab源代码。-err
Platform: | Size: 9216 | Author: 烈马 | Hits:

[Algorithmclara

Description: CLARA是基于k中心点的一种划分方法的实现,区别于别的划分方法,Clara是用于大规模分类运用方法的简称,可以实现对大规模数据的分类-CLARA(abbreviated from clustering large applications), is based on the k-medoid appraoch, which can be useful in clustering large data sets.
Platform: | Size: 13312 | Author: 林文 | Hits:

[matlabkMedoids

Description: k-中心聚类算法的matlab实现。直接读取文档数据,没有维限制。-k-Medoids clustering algorithm matlab implementation. Document data read directly, there is no dimension restrictions.
Platform: | Size: 2048 | Author: | Hits:

[matlabclustering

Description: 模糊聚类算法,K-means and K-medoid algorithms,Fuzzy C-means algorithm,The Gustafson{Kessel algorithm,The Gath{Geva algorithm-Fuzzy clustering algorithm, K-means and K-medoid algorithms, Fuzzy C-means algorithm, The Gustafson (Kessel algorithm, The Gath (Geva algorithm
Platform: | Size: 4220928 | Author: twty | Hits:

[AI-NN-PRms0023ClusterKMedoids

Description: K-medoid algorithm implemented in C
Platform: | Size: 4096 | Author: msigdel | Hits:

[JSP/JavaK_Medoids

Description: java code on k-medoid
Platform: | Size: 1024 | Author: animesh | Hits:

[matlabK-medoid-Archive

Description: this is KMedoids clustering algorithem.
Platform: | Size: 18432 | Author: yasir | Hits:

[Otherk-mediod-PAM

Description: k-medoids with matlab is very strong
Platform: | Size: 863232 | Author: akbari1368 | Hits:
« 12 »

CodeBus www.codebus.net