基于Spark云计算平台的改进K近邻算法研究-计算机技术专业论文.docxVIP

基于Spark云计算平台的改进K近邻算法研究-计算机技术专业论文.docx

  1. 1、本文档共57页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
基于Spark云计算平台的改进K近邻算法研究-计算机技术专业论文

Abstract Abstract With the rapid development of the modelTl era of the Internet,people have gradually entered the era of big data.In the face of an array of data,the user how to quickly find information to meet their own needs to become a hot research problem in urgent need of the academic community.Internet risers efficiently tap the information requirements more stringent than forward.Data mining methods can be achieved from massive data efficiently dig out accurate data.Data mining classification algorithms to predict trends in the data,we recommend an effective means to meet the wishes of the user data Wherein,K nearest neighbor classification algorithm is the large—scale spatial data query data mining one common classification algorithm.Through cloud computing platform may further increase the operating speed of data mimng.Spark cloud computing platform is further optimized Hadoop cloud-based platform.Unlike Hadoop HDFS file system is totally dependent,Spark possible to handle data in memory set to further improve the data processing speed of the cloud platform. For users to quickly access the information needs,this paper on the Spark cloud computing platform,the use of parallel improved K nearest neighbor classification algorithm to achieve the goal of providing users with the recommended data quickly This paper puts forward two points:first,this paper improves the K nearest neighbor classification algorithm index creation technology,and improves the efficiency of the algorithm tO find the nearest neighbor data points.The traditional K nearest neighbor classification algorithm is the main control factor is to find the neare st neighbor data point efficiency is low,Tree K nearest neighbor is applied to the Kd classification algorithm index to create the search efficiency of the data structure.The running efficiency of Tree Kd is mainly in the process of the nearest neighbor search for non—leaf nodes.In this paper,by optimizing the KD tree to be classified dat

您可能关注的文档

文档评论(0)

131****9843 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档