Search - kmeans.rar

Search - kmeans.rar - List

[Graph program] KMEANS.rar DL : 0: Update : 2025-02-17 Size : 29.05kb Publisher :
[AI-NN-PR] MFY_kmeans DL : 0: 这是我帮一个本科生做的毕业设计，实现的数据挖掘的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
Update : 2025-02-17 Size : 154kb Publisher : 孟繁宇
[Graph program] kmeans(JAVA) DL : 0: JAVA实现的聚类中心的计算算法比较简单望多多指教提宝贵意见-JAVA realize the cluster center is relatively simple algorithm for calculating the exhibitions look to the valuable advice
Update : 2025-02-17 Size : 2kb Publisher : sunny
[AI-NN-PR] kmeans_clustering DL : 0: JAVA实现的KMENAS聚类算法共有5个JAVA源文件请各位指教 -JAVA clustering algorithm KMENAS realize a total of five JAVA source files please advise
Update : 2025-02-17 Size : 4kb Publisher : sunny
[AI-NN-PR] fastkmeans DL : 0: fast implementation of Kmeans clustering algorithm
Update : 2025-02-17 Size : 3kb Publisher : jwj
[AI-NN-PR] fastkmeans DL : 0: matlab版本的k-means聚类程序，很简单易懂，适用于matlab和聚类的初学者-matlab version of the k-means clustering procedure is very simple and easy to understand, apply and clustering matlab beginner
Update : 2025-02-17 Size : 3kb Publisher : qianwen
[Special Effects] imagesegmentation DL : 1: 压缩文件里有四种图像分割的算法源代码，即阈值法、区域增长法、分裂合并法和K均值法。图片可用于检验。-The rar folder includes four source code of image segmentation,ie.thresholding, region growing, splitting and merging, kmeans. The images are able to be used for evaluation and verification.
Update : 2025-02-17 Size : 153kb Publisher : 杨岩
[AI-NN-PR] EvaluateMetric DL : 0: Clustering Evaluation: Evaluate the clustering result by accuracy and normalized mutual information Deng Cai, Xiaofei He, and Jiawei Han, "Document Clustering Using Locality Preserving Indexing", in IEEE TKDE, 2005. Bibtex source bestMap hungarian MutualInfo =========================================== fea = rand(50,70) gnd = [ones(10,1) ones(15,1)*2 ones(10,1)*3 ones(15,1)*4] res = kmeans(fea,4) res = bestMap(gnd,res) ============= evaluate AC: accuracy ============== AC = length(find(gnd == res))/length(gnd) ============= evaluate MIhat: nomalized mutual information ================= MIhat = MutualInfo(gnd,res) -Clustering Evaluation: Evaluate the clustering result by accuracy and normalized mutual information Deng Cai, Xiaofei He, and Jiawei Han, "Document Clustering Using Locality Preserving Indexing", in IEEE TKDE, 2005. Bibtex source bestMap hungarian MutualInfo =========================================== fea = rand(50,70) gnd = [ones(10,1) ones(15,1)*2 ones(10,1)*3 ones(15,1)*4] res = kmeans(fea,4) res = bestMap(gnd,res) ============= evaluate AC: accuracy ============== AC = length(find(gnd == res))/length(gnd) ============= evaluate MIhat: nomalized mutual information ================= MIhat = MutualInfo(gnd,res) ===========================================
Update : 2025-02-17 Size : 5kb Publisher : wzy
[Software Engineering] KMeansExample DL : 0: This rar consists of a document which describes about Kmeans algorithm
Update : 2025-02-17 Size : 197kb Publisher : vj