登录

于 2022-05-24 发布 文件大小:270.04 kB
0 206
下载积分: 2 下载次数: 1

代码说明:

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 .

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 这是一个利用Visaual C++完成的基于神经网络方法的专家系统源代码...
    这是一个利用Visaual C++完成的基于神经网络方法的专家系统源代码-This is a use of Visaual C++ Completion method based on neural network expert system source code
    2022-01-26 04:39:02下载
    积分:1
  • 此目录包含执行该目录的代码
    This directory contains code implementing the K-means algorithm. Source codemay be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANSprogram accepts input consisting of vectors and calculates the givennumber of cluster centers using the K-means algorithm. Output isdirected to the screen.
    2022-12-30 17:05:03下载
    积分:1
  • 这里是一个利用人工智能的八个数字源代码,并对..
    这里有一个用vc写的人工智能八数码源代码,,非常有参考价值,感兴趣的或者是需要的人可以来下载哦~-Here is a use of artificial intelligence was vc eight digital source code, and very useful, or is interested in need can be downloaded from Oh!
    2022-01-25 16:06:35下载
    积分:1
  • KNN algorithm, the framework is very clear. Is a classic East
    knn算法的实现,框架十分清楚。是经典的东西-KNN algorithm, the framework is very clear. Is a classic East-West
    2023-03-07 18:15:02下载
    积分:1
  • 八数码难题求解程序本程序所采用的启发函数,本人不能证明它能解决任何的八数码难题,如果对于较难的问题会产生很多节点,有可能会使空间不足,所以尽量不要出太难的问题难
    八数码难题求解程序本程序所采用的启发函数,本人不能证明它能解决任何的八数码难题,如果对于较难的问题会产生很多节点,有可能会使空间不足,所以尽量不要出太难的问题难为它.希望广大的人工智能爱好者能写出更好的启发函数.-eight digital problem solving program of the procedures used by the heuristic function, I can not prove that it can resolve any of the eight digital problem, if for the more difficult problems will have many nodes, it is likely to lack of space, so as not up to the difficult problems it hard. I hope the love AI who better to write a heuristic function better.
    2022-02-02 13:36:33下载
    积分:1
  • SVM的讲义!具体的内容可以自己看!很详细的
    SVM的讲义!具体的内容可以自己看!很详细的-SVM lectures! Specific content can look! Very detailed
    2022-03-30 10:30:25下载
    积分:1
  • 汉语分词系统,对中文语句进行识别,然后分词,是很好的自然语言理解的例子...
    汉语分词系统,对中文语句进行识别,然后分词,是很好的自然语言理解的例子-Chinese word segmentation system, the Chinese phrase for identification, then Word, is a very good natural language understanding examples
    2022-07-25 08:51:26下载
    积分:1
  • 1。《遗传算法的数学基础》,张文修、梁怡编着 西安交通大学出版社 2000年第一版 遗传算法(genetic algorithm)是模拟自然界生物进化...
    1。《遗传算法的数学基础》,张文修、梁怡编着 西安交通大学出版社 2000年第一版 遗传算法(genetic algorithm)是模拟自然界生物进化过程与机制求解问题的一类自组织与自适应的人工智能技术,已广泛应用于计算机科学、人工智能、信息技术及工程实践。 本书重点在于阐述遗传算法的数学基础。全书共分3章,第1章给出了遗传算法的几何理论,第2章给出了遗传算法的马尔可夫链分析,第3章给出了遗传算法的收敛理论。 本书可以作为应用数学、计算机科学、系统科学等专业研究生的教材,也可以作为研究遗传算法的参考书。 -1. "Genetic Algorithm mathematical basis," Zhang Xiu, Yi Liang compile Xi"an Jiaotong University Press in 2000 the first edition of the genetic algorithm (genetic algorit hm) is a simulation of natural biological evolution process and mechanisms to solve the problem of a kind of self-organization and adaptive artificial intelligence technology, has been widely used in computer science, artificial intelligence, information technology, and engineering practice. The book focused on the genetic algorithm described math. The book is divided into three chapters, one chapter is a genetic algorithm of the geometric theory Chapter 2 of the genetic algorithm is a Markov chain analysis, presented in Chapter 3 of the geneti
    2022-01-26 08:04:46下载
    积分:1
  • 遗传问题的MATLAB代码,用于解决TSP问题的程序
    遗传问题的MATLAB代码,用于解决TSP问题的程序-Genetic problems MATLAB code for the procedure to solve TSP problems
    2022-10-30 01:55:04下载
    积分:1
  • cost存放了一个强连通图的边权矩阵,作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给...
    cost存放了一个强连通图的边权矩阵,作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
    2023-07-15 08:15:03下载
    积分:1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载