【24h】

Correlation-based K-Nearest Neighbor Algorithm

机译:基于相关性的K最近邻算法

获取原文
获取原文并翻译 | 示例

摘要

Data classification is an important task of data mining, and developing high-powered classification algorithm is one of the key procedures for data mining. This paper provides an improved K-nearest neighbor algorithm—correlation-based K-nearest neighbor algorithm. This new algorithm makes data classification base on the correlation calculation, and uses a modified probability to improve the computational speed and prediction accuracy. The experimental results show that the correlation-based K-nearest neighbor algorithm is more suitable to classify massive high-dimensional data sets while comparing with traditional K-nearest neighbor algorithm.
机译:数据分类是数据挖掘的重要任务,开发高性能分类算法是数据挖掘的关键程序之一。本文提供了一种改进的K最近邻居算法-基于相关的K最近邻居算法。该新算法基于相关性计算进行数据分类,并使用修改后的概率来提高计算速度和预测精度。实验结果表明,与传统的K近邻算法相比,基于相关性的K近邻算法更适合对海量高维数据集进行分类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号