毕业设计-基于K-Means算法的平面点集聚类系统

上传者: lxhtigerzy | 上传时间: 2021-04-07 12:32:13 | 文件大小: 5.54MB | 文件类型: ZIP
用K-Means算法 K-Harmonic Means算法分别对平面上的点集进行聚类 并对结果进行比较

文件下载

资源详情

[{"title":"( 30 个子文件 5.54MB ) 毕业设计-基于K-Means算法的平面点集聚类系统","children":[{"title":"毕业设计-基于K-Means算法的平面点集聚类系统","children":[{"title":"程序","children":[{"title":"sample.txt <span style='color:#111;'> 300B </span>","children":null,"spread":false},{"title":"win_K_means.exe <span style='color:#111;'> 180.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"任务书及论文","children":[{"title":"任务书.doc <span style='color:#111;'> 37.00KB </span>","children":null,"spread":false},{"title":"论文.doc <span style='color:#111;'> 649.00KB </span>","children":null,"spread":false}],"spread":true},{"title":"源代码","children":[{"title":"Random.h <span style='color:#111;'> 338B </span>","children":null,"spread":false},{"title":"ManageMem.cpp <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false},{"title":"do_K_means.cpp <span style='color:#111;'> 4.05KB </span>","children":null,"spread":false},{"title":"do_K_means.h <span style='color:#111;'> 833B </span>","children":null,"spread":false},{"title":"win_K_means.dsp <span style='color:#111;'> 4.69KB </span>","children":null,"spread":false},{"title":"ManageMen.h <span style='color:#111;'> 258B </span>","children":null,"spread":false},{"title":"resource.rc <span style='color:#111;'> 4.74KB </span>","children":null,"spread":false},{"title":"result.txt <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false},{"title":"do_K_means_Plus.h <span style='color:#111;'> 469B </span>","children":null,"spread":false},{"title":"win_K_means.dsw <span style='color:#111;'> 545B </span>","children":null,"spread":false},{"title":"sample.txt <span style='color:#111;'> 375B </span>","children":null,"spread":false},{"title":"win_K_means.opt <span style='color:#111;'> 58.50KB </span>","children":null,"spread":false},{"title":"win_K_means.cpp <span style='color:#111;'> 11.01KB </span>","children":null,"spread":false},{"title":"win_K_means.ncb <span style='color:#111;'> 129.00KB </span>","children":null,"spread":false},{"title":"Random.cpp <span style='color:#111;'> 3.57KB </span>","children":null,"spread":false},{"title":"resource.h <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false},{"title":"VA_C__Documents and Settings_Administrator_Local Settings_Application Data_VisualAssist_vc6_history_ <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"random.txt <span style='color:#111;'> 965B </span>","children":null,"spread":false},{"title":"win_K_means.h <span style='color:#111;'> 968B </span>","children":null,"spread":false},{"title":"do_K_means_Plus.cpp <span style='color:#111;'> 1.92KB </span>","children":null,"spread":false},{"title":"resource.aps <span style='color:#111;'> 23.80KB </span>","children":null,"spread":false},{"title":"def_KPOINT.h <span style='color:#111;'> 92B </span>","children":null,"spread":false},{"title":"win_K_means.plg <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"KMEANS.ico <span style='color:#111;'> 4.43KB </span>","children":null,"spread":false}],"spread":false},{"title":"参考材料","children":[{"title":"HPL-1999-124.pdf <span style='color:#111;'> 4.14MB </span>","children":null,"spread":false},{"title":"数据挖掘中几种划分聚类算法的比较及改进.pdf <span style='color:#111;'> 1.77MB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]

评论信息

  • 大黑找小白 :
    程序界面清晰直观,有论文有源代码有数据
    2014-04-20
  • vekaco :
    做的挺好的毕业设计,可借鉴
    2013-08-16
  • chenhuimao :
    程序界面清晰直观,有论文有源代码有数据
    2013-06-28
  • jacqueline_723 :
    参考下 做作业用的 还行吧 没什么特别的
    2013-02-04
  • 大志若愚 :
    非常好的资源,有论文,有代码。
    2012-12-23
  • xiaotian_stone :
    主要是看k调和均值的,比较简单的介绍。
    2012-12-17

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明