Search - k-means

Search - k-means - List

【matlab】 ClusterBasics-V1.0 DL : 0: 各类聚类算法程序包，包含各种经典的聚类算法，例如：k-mean聚类等-Various types of clustering algorithm package, contains a variety of classic clustering algorithms, such as: k-mean clustering, etc.
Update : 2024-05-14 Size : 201728 Publisher : 王朝霞
【Data structs】 k_mean DL : 0: K_mean K均值算法 C语言-K_mean K means algorithm C language
Update : 2024-05-14 Size : 1024 Publisher : lucia
【Graph program】 matlab_MRF DL : 0: k-均值算法的源码很有用，希望有帮助，请多多指点-k-means algorithm is useful source of hope that has helped, please instruct it
Update : 2024-05-14 Size : 18432 Publisher : 朱莉
【AI-NN-PR】 gaknn2008-12-08 DL : 0: 本算法是实现基于KNN的基因遗传算法，是对KNN算法的改进，具有更好的分类效果。-gaKnn[Genetic Algorithm Optimized K Nearest Neighbor Classification framework] is a frameowork for KNN optimization with a genetic algorithm.
Update : 2024-05-14 Size : 26624 Publisher : sally
【matlab】 kcluster DL : 0: 一种基于软划分方法的聚类方法——模糊k均值法聚类分析。-A division of methods based on soft clustering method- fuzzy k-means cluster analysis.
Update : 2024-05-14 Size : 1024 Publisher : wyl
【Windows Develop】 2 DL : 0: 一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。编程任务：对于给定的n和k(k <= 10000)个加油站位置，编程计算最少加油次数。 -Top up after a car traveling n kilometers. The road has a number of gas stations. Design an effective algorithm that should be docked at what gas stations come on, so come on the least number of along the way. Programming tasks: For a given n and k (k < = 10000) the location of gas stations, at least come on the number of computing programming.
Update : 2024-05-14 Size : 150528 Publisher : JC
【Other】 k-MeansJava DL : 0: k-Means算法Java实现数据挖掘中经典的Kmeans算法设计与实现-k-Means Algorithm for Data Mining Java implementation of the classic algorithm design and implementation Kmeans
Update : 2024-05-14 Size : 49152 Publisher : 闫珍
【Special Effects】 ycbcrkmeanidentify DL : 0: k均值,YCbCr空间的，用于图像分割。-k-means
Update : 2024-05-14 Size : 1024 Publisher : 丽丽
【matlab】 numerical_analysis_homework DL : 0: (有源代码)数值分析作业,本文主要包括两个部分,第一部分是常微分方程(ODE)的三个实验题,第二部分是有关的拓展讨论,包括高阶常微分的求解和边值问题的求解(BVP).文中的算法和算例都是基于Matlab计算的.ODE问题从刚性(STIFFNESS)来看分为非刚性的问题和刚性的问题,刚性问题(如大系数的VDP方程)用通常的方法如ODE45来求解,效率会很低,用ODE15S等,则效率会高多了.而通常的非刚性问题,用ODE45来求解会有很好的效果.从阶次来看可以分为高阶微分方程和一阶常微分方程,高阶的微分方程一般可以化为状态空间(STATE SPACE)的低阶微分方程来求解.从微分方程的性态看来,主要是微分方程式一阶导系数大的时候,步长应该选得响应的小些.或者如果问题的性态不是太好估计的话,用较小的步长是比较好的,此外的话Adams多步法在小步长的时候效率比R-K(RUNGE-KUTTA)方法要好些,而精度也高些,但是稳定区间要小些.从初值和边值来看,也是显著的不同的.此外对于非线性常微分方程还有打靶法,胞映射方法等.而对于微分方程稳定性的研究,则诸如相平面图等也是不可缺少的工具.值得提出的是,除了用ode系类函数外,用simulink等等模块图来求解微分方程也是一种非常不错的方法,甚至是更有优势的方法(在应用的角度来说).-(Source code) numerical analysis homework, this docment includes two parts, the first is ordinary differential equations (ODE) of the three examples, the second part is about the expansion of the discussion, including the higher-order ordinary differential & boundary value solution Problems (BVP). the text of the algorithm and numerical examples are based on the Matlab. ODE from the rigid (STIFFNESS) look into the issue of non-rigid and rigid problem, rigid problems (such as large coefficient VDP equation) such as using the always method ODE45 used to solve the problems , efficiency will be low, with ODE15S the other hand, many of the high efficiency. and the usual problem of non-rigid, there will be used to solve ODE45 very good results. Judging from the order can be for high-order differential equations and first-order ordinary differential equations, higher-order differential equations can be transformed into a general state space (STATE SPACE) used to solve the low-order different
Update : 2024-05-14 Size : 351232 Publisher : wjl
【JSP/Java】 k_means_cluster DL : 0: this program explains the K_means cluster Algorithm. and also direct to the best k value
Update : 2024-05-14 Size : 3072 Publisher : muthu
【matlab】 BruteSearch DL : 0: K-nearest neighbors 搜索聚类时经常使用的一种方法国外网站转载- The following utilities are provided: - Nearest neighbor - K-Nearest neighbors - Radius Search They al supports N-dimensions and work on double, it is possible to choose if return the distances. Here is a time comparison with a vectrized m-code: N=1000000 number of reference points Nq=100 number of query points dim=3 dimension of points k=3 number of neighbor tic [idc,dist]=BruteSearchMex(p ,qp , k ,k) MEX toc tic [idc,dist]=knnsearch(qp,p,k) VECTORIZED M-CODE toc p=rand(N,dim) qp=rand(Nq,dim) Output: Elapsed time is 0.962640 seconds. Elapsed time is 18.813100 seconds.
Update : 2024-05-14 Size : 4096 Publisher : Ming
【AI-NN-PR】 knn DL : 0: k近邻（knn）分类的文献，英文的，从IEEE下载得到，希望对大家有用-k neighbors (knn) classification of literature, English, and download from the IEEE has been the hope that useful for everyone
Update : 2024-05-14 Size : 1872896 Publisher : 宦若虹
【Mathimatics-Numerical algorithms】 K-means DL : 0: K-均值聚类分析，程序不完整,急需下载东西，所以出此下策，请谅解！-K－means Clustering
Update : 2024-05-14 Size : 135168 Publisher : 任尚昆
【matlab】 travailenmat DL : 0: matlab programming for clustering pam , k-means , dbscan , optics for image segmentation
Update : 2024-05-14 Size : 21504 Publisher : Ben hassen Amer
【Mathimatics-Numerical algorithms】 Kmeans DL : 0: The mathematic method K-Means with delphi, a smaal essay, with graphic representation-The mathematic method K-Means with delphi, a smaal essay, with graphic representation....
Update : 2024-05-14 Size : 351232 Publisher : Abdallah
【AI-NN-PR】 FuzzyNNClassifier DL : 0: 模糊K近邻分类器，模式识别和机器学习经常要使用的一个分类器-K neighbor fuzzy classifier, pattern recognition and machine learning are often used in a classifier
Update : 2024-05-14 Size : 429056 Publisher : chen
【AI-NN-PR】 k_means DL : 0: k-means(欧氏距离)聚类算法是最基本的聚类算法，是理解和应用聚类算法的基础，通过k-means(欧氏距离)聚类算法我们才可以初步了解数据挖掘的原理。-k-means (Euclidean distance) clustering algorithm is the most basic clustering algorithm, is understanding and the basis for the application of clustering algorithm, through the k-means (Euclidean distance) clustering algorithm we are able to a preliminary understanding of the principles of data mining .
Update : 2024-05-14 Size : 276480 Publisher : 徐加子
【RFID】 knnrfid DL : 0: KNN. K- Neighbor Nearest Algorithm
Update : 2024-05-14 Size : 1957888 Publisher : anand
【CSharp】 kmean2 DL : 0: 用VC写的关于k-mean聚类算法的程序。-Written by VC on the k-mean clustering algorithm procedure.
Update : 2024-05-14 Size : 1024 Publisher : Calvin Chen
【AI-NN-PR】 kNN DL : 1: It s the kNN or else named k-Nearest Neabours algorythm, realized by the tools of Visual Studio developer system.
Update : 2024-05-14 Size : 30720 Publisher : Alex

« 1 2 ... 42 43 44 45 46 4748 49 50 »