Search - K-mean

[Other resource] K均值

Description: 本程序通过k均值算法对两类进行分类。通过任意选择初始点，由k均值很快找到两类的中心点-the procedure k means algorithm to classify two types. Through arbitrary choice initial point, k Mean quickly found two focal point
Platform: | Size: 102432 | Author: luxiangzz | Hits:

[Other resource] K均值算法

Description: 实现K均值算法，读取文件，实现K均值的分类。-K-means algorithm to achieve, reading the paper, K-mean achievement category.
Platform: | Size: 32536 | Author: 杨爽 | Hits:

[Other resource] K-meanCluster

Description: 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 following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
Platform: | Size: 2004 | Author: yangdi | Hits:

[Special Effects] k-mean

Description: k-均值算法做的图象分割实例（将图片像素聚成三类）
Platform: | Size: 104800 | Author: 姜波 | Hits:

[Mathimatics-Numerical algorithms] k-mean

Description: 算法描述： K均值算法：给定类的个数K，将N个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。
Platform: | Size: 2150 | Author: LW | Hits:

[Other resource] k-mean

Description: K-means聚类算法的java实现描述！有详尽的说明，对初学者非常有用！
Platform: | Size: 2798 | Author: Joney | Hits:

[Mathimatics-Numerical algorithms] KClustering

Description: k-聚类算法-k- gathers a kind of algorithm
Platform: | Size: 249856 | Author: 成伟明 | Hits:

[Windows Develop] k-means代码

Description: 这只是我从其它网站上下载的-from other websites on the download
Platform: | Size: 773120 | Author: 孙宁 | Hits:

[AI-NN-PR] kmeans聚类算法源码

Description: k均值聚类算法源码，比较经典，无解压密码-kmeans clustering algorithm source code,comparatively classical,no password for unzip
Platform: | Size: 29696 | Author: 司南 | Hits:

[ADO-ODBC] 新建 Microsoft Word 文档 (3)

Description: 基于划分的聚类分析算法k-means,主要用于数据挖掘领域.-Partition- based cluster analysis algorithm k-means, used mainly for data mining areas.
Platform: | Size: 3072 | Author: 许朝 | Hits:

[AI-NN-PR] MFY_kmeans

Description: 这是我帮一个本科生做的毕业设计，实现的数据挖掘的k均值和k中心算法，其中包含了我做的两个二维的数据集，感觉要预先知道k的参数值，不是很方便-This is what I do to help an undergraduate graduation Design, Implementation of the Data Mining mean k and k center algorithm, which includes me to do two two-dimensional data sets, feeling to know beforehand the value of the parameter k is not easy
Platform: | Size: 157696 | Author: 孟繁宇 | Hits:

[Documents] 一种新的聚类分析距离算法

Description: K均值是一个预先知道类数的算法，需要具备专业知识，不现实。本文提出一个确定类数的方法。-K is a means to know in advance the number of categories algorithm, requires expertise and unrealistic. This paper presents a number of categories to determine the method.
Platform: | Size: 31744 | Author: 李中 | Hits:

[matlab] MyKmeans

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-PR] KMeansClustering

Description: k均值聚类的算法，这是通用程序！欢迎借鉴使用-k average value gathers a kind of algorithm, this is the general routine! Welcome to profit from uses
Platform: | Size: 20480 | Author: 李凯 | Hits:

[Other] KMEANS01

Description: This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.-This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.
Platform: | Size: 270336 | Author: 赵丁香 | Hits:

[matlab] 数据挖掘常用算法

Description: 数据挖掘常用的算法，包括id3，k均值，FCM，SVM,CART五个常用的算法，是用matlab编写的。-commonly used data mining algorithms, including id3, k mean, FCM, the SVM, CART five commonly used algorithm is the use of Matlab prepared.
Platform: | Size: 18432 | Author: 李冬宾 | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list