Search - k-means

Search - k-means - List

【ADO-ODBC】 KMEANS DL : 0: k-means 动态聚类算法源程序非常好用高的效率-Dynamic k-means clustering algorithm is very useful source of high efficiency
Update : 2024-05-15 Size : 29696 Publisher : 张红
【Other】 UseMatlabandCtorealizeKmeans DL : 0: 这是一个用c和matlab编写的程序，用于实现k-means算法-This is a matlab with c and the preparation of the procedures used to implement k-means algorithm
Update : 2024-05-15 Size : 6144 Publisher : 海天
【AI-NN-PR】 DataMining20070102 DL : 0: DataMining软件(集成了关联规则、k-均值聚类、模糊聚类、k-中心点聚类四种算法) -DataMining software (integrated association rules, k-means clustering, fuzzy clustering, k-center clustering of four algorithms)
Update : 2024-05-15 Size : 137216 Publisher : Jim
【Database system】 KMEANSII DL : 0: 神经网络中的K均值聚类算法II： 1.KMIn为输入数据文本，其中，第一个参数为所要聚类点个数，第二个参数为聚类点的维数,第三个参数为所要求聚类的个数 2.KM2OUT为经过K均值聚类算法II计算后得到的结果-Neural network in K-means clustering algorithm II: 1.KMIn input data for the text, of which the first parameter to be the number of clustering points, the second parameter is the dimension of clustering points, the third parameter for the clustering the number of requests for 2.KM2OUT after K-means clustering algorithm II calculation results
Update : 2024-05-15 Size : 277504 Publisher : blue8202
【.net】 Kmeans DL : 0: 在Visual C++.NET2003平台下实现聚类算法中的K-MEANS算法，对随机生成的点进行了聚类。使用单文档结构，并将聚类结果显示出来。-In the Visual C++. NET2003 platform clustering algorithm to achieve the K-MEANS algorithm, on randomly generated points in the cluster. Use a single document structure, and clustering results are displayed.
Update : 2024-05-15 Size : 63488 Publisher : 杨维斌
【Algorithm】 KMeansCSharp DL : 0: k均值聚类的c#版本，我从网上找到的c版本经改造而成-k-means clustering of the c# version, I found from the Internet version of the modified form c
Update : 2024-05-15 Size : 2048 Publisher : 张恒敢
【Graph program】 K_average DL : 0: K均值聚类算法,matlab编写,很好用-K means clustering algorithm, matlab prepared very well with
Update : 2024-05-15 Size : 2048 Publisher : 桂长青
【AI-NN-PR】 kmean DL : 0: 模式识别算法 k均值和感知器算法的具体实现实例-Pattern recognition algorithm for k-means algorithm and the perceptron realize specific examples
Update : 2024-05-15 Size : 177152 Publisher : fengyuan
【Documents】 yizhongK-meanssuanfadeshixian DL : 0: 自己花费整整两个星期写出来的关于数据挖掘K-means算法的论文，论文中详细的进行了论述并提出了改进后的算法以及对比欢迎下载-Of them have to spend a full two weeks to write out data mining on the K-means algorithm thesis paper discussed in detail and put forward an improved algorithm and welcome contrast to Download
Update : 2024-05-15 Size : 60416 Publisher : zjz
【AI-NN-PR】 K_MEANS DL : 0: 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.
Update : 2024-05-15 Size : 29696 Publisher :
【AI-NN-PR】 k-means DL : 0: kmeans 算法实现，有需要的下载下去，有问题大家一起讨论啊，-kmeans algorithm, there is a need to download it, there are issues to discuss U.S. ah,
Update : 2024-05-15 Size : 242688 Publisher : 刘磊
【AI-NN-PR】 K_Means DL : 0: k-means是一种经典的聚类算法，这是用java实现k-means的源码，其中包括了测试数据文件-k-means is a classical clustering algorithm, which is used k-means realize java source code, including test data files
Update : 2024-05-15 Size : 4096 Publisher : 尹哲
【MPI】 K-meanCluster DL : 0: 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. -How the K-mean Cluster workStep 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 (Nk) 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.
Update : 2024-05-15 Size : 2048 Publisher : yangdi
【matlab】 K_MEANS DL : 0: K-MEANS算法程序(MATLAB环境)-K-MEANS algorithm procedure (MATLAB environment)
Update : 2024-05-15 Size : 1024 Publisher : liuwei
【Windows Develop】 Kmean DL : 0: 利用数据挖掘知识和vb实现K-均值聚类分析，本程序提供了训练样本和测试样本，经过训练正确率达70-76％-Knowledge and use of data mining vb achieve K-means clustering analysis, the procedures provided training samples and test samples, after training in the correct rate of 70-76
Update : 2024-05-15 Size : 31744 Publisher : 111111
【AI-NN-PR】 wkmeans DL : 0: 加权k均值算法，或者称为加权C均值聚类算法-Weighted k-means algorithm, or as the weighted means clustering algorithm C
Update : 2024-05-15 Size : 1024 Publisher : 忠波
【Mathimatics-Numerical algorithms】 K-meansC++ DL : 0: K——聚类算法的C++源码，摘抄的部分，供大家参考-K- clustering algorithm C++ Source, extract the parts for your reference
Update : 2024-05-15 Size : 2048 Publisher :
【Special Effects】 Kmeas DL : 0: 这是一个自己编的基于K均值聚类算法的图象分割软件，界面操作窗口化，很容易操作-This is an own-based K-means clustering algorithm for image segmentation software, the interface window of operation, it is easy to operate
Update : 2024-05-15 Size : 2249728 Publisher : 王力
【AI-NN-PR】 Medoidshift DL : 1: 中心点漂移是一种非监督聚类算法（与k-means算法相似，但应用范围更广些),可用于图像分割，基于Matlab实现的源码。 MedoidShift is a unsupervised clustering algorithm(similar to k-means algorithm, but can be used in border application fields), can be used for image segmentation. Included is the Matlab implementation source code.-Center drift is a non-supervised clustering algorithm (k-means algorithm with the similar, but more a wider range of applications), can be used for image segmentation, based on the realization of the source Matlab. MedoidShift is a unsupervised clustering algorithm (similar to k-means algorithm, but can be used in border application fields), can be used for image segmentation. Included is the Matlab implementation source code.
Update : 2024-05-15 Size : 36864 Publisher : 陈明
【AI-NN-PR】 newkmeans.tar DL : 0: 基本的k-means聚类算法c++实现，对于理解算法的过程非常有帮助。 Basic implementation of k-means algorithm with c++, it is very helpful to understand the procedure of k-means algorithm.-Basic k-means clustering algorithm c++ Realization algorithm for understanding the process very helpful. Basic implementation of k-means algorithm with c++, It is very helpful to understand the procedure of k-means algorithm.
Update : 2024-05-15 Size : 4096 Publisher : 陈明

« 1 2 ... 6 7 8 9 10 1112 13 14 15 16 ... 50 »