搜索资源列表
K-mean
- K-mean algorithm,very simple but efficient
KMeansBMPSeg
- 模式识别经典方法之一 K均值算法（KMeans）进行图像分割 有完善的图形界面 可以通过柱状图的形式动态展示聚类程序-One of the classical method of pattern recognition K means algorithm (KMeans) for image segmentation has improved graphical interface can be dynamically displayed in the form of histogram clu
k-means
- 用C++实现k-mean聚类算法并进行初级的数据挖掘，-Using C++, k-mean clustering algorithm and a preliminary data mining,
K_Means
- K-Means(java)算法 有界面,可从文本中读取数据-K-Means (java) algorithm has interface to read data from text
K-Means
- K-Means动态聚类算法源程序 K-Means动态聚类算法源程序
k-means
- k-means算法用matla实现车牌定位-License plate location achieved with matla
k-means
- 用c程序和matlab分别试验一种k-means改进算法，按照方法选取聚类中心点，事实证明，这种改进是有效的。-Matlab with c procedures and were experimenting with an improved k-means algorithm, in accordance with the method of selecting cluster center, the facts show that this improvement is effective.
Kjunzhi
- K－均值聚类算法C++编程-...
junzhi
- k-均值算法，主要进行在matlab中的程序实现，进行图像的分割处理-k-means algorithm, mainly for the program in the matlab implementation for image segmentation
proje
- applied k means clustering for vector quanta and used huffman for image compression matlab code
K-L
- 基于K-L的人脸识别源代码 与大家共同学习 -KL-based face recognition source code and learn together Thank you
Knearest
- K近邻方法实现0到9数字的模式识别问题。可扩展性很强，方面实现训练和识别。-K nearest neighbor method to achieve 0 to 9 digit pattern recognition problem. Highly scalable, achieving training and recognition.
DBSCAN
- Matlab --- --- --- --- --- --- --- --- --- --- --- --- - Function: [class,type]=dbscan(x,k,Eps) ------------------------------------------------------------------------- Aim: Clustering the data with Density-Based Scan Algorithm with Noi
k-means
- C++实现的k-means聚类算法 k-means聚类算法是一种划分的聚类算法-k-means c++
fcm
- 模糊C均值方法，将模糊的方法用到K均值方法里面-Fuzzy C Means method, the fuzzy approach method which used the mean K
moja_PVA_normiran_KNN_koncan
- PCA with K-nn classifier(for pictures)
knear
- K均值算法，用于聚类，程序写得比较好，容量读-K means algorithm for clustering, procedures written better, capacity Reading
qichejiayou
- 一辆汽车加满油后可行驶n公里，旅途中有若干个加油站，设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少，对于给定的n和k个加油站位置，编程计算最少加油次数。 可以利用贪心选择性质来求解汽车加油问题，也就是所求问题的整体最优解可以通过一系列局部最优的选择，即贪心选择来达到。这是贪心选择算法可行的第一个基本要素，也是贪心算法与动态规划算法的主要区别。在动态规划算法中，每步所做的选择往往信赖于相关子问题的解，因而只有在解出相关子问题后，才能做出选择。而在贪心算法中仅在当前状态下做出最
K-means
- 用matlab实现的聚类，效果很好，里面有部分数据，点击可以直接运行-Cluster with matlab to achieve good results, which are part of the data, click directly run
stock_k_line_code
- 多种用flash展现方式，如k先，蜡烛图，曲线图等-Demonstrated using a variety of flash modes such as k first, candle chart, graphs, etc.