首页> 外文会议>Advances in Neural Networks - ISNN 2007 pt.2; Lecture Notes in Computer Science; 4492 >Clustering-Based Reference Set Reduction for k-Nearest Neighbor
【24h】

Clustering-Based Reference Set Reduction for k-Nearest Neighbor

机译:k最近邻的基于聚类的参考集约简

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

摘要

Response Modeling is concerned with computing the likelihood of a customer to respond to a marketing campaign. A major problem encountered in response modeling is huge volume of data or patterns. The k-NN has been used in various classification problems for its simplicity and ease of implementation. However, it has not been applied to problems for which fast classification is needed since the classification time rapidly increases as the size of reference set increases. In this paper, we propose a clustering-based preprocessing step in order to reduce the size of reference set. The experimental results showed an 85% decrease in classification time without a loss of accuracy.
机译:响应模型与计算客户对营销活动做出响应的可能性有关。响应建模中遇到的主要问题是大量的数据或模式。由于其简单性和易于实现性,k-NN已用于各种分类问题。但是,由于分类时间随着参考集的大小增加而迅速增加,因此尚未应用于需要快速分类的问题。在本文中,我们提出了一种基于聚类的预处理步骤,以减小参考集的大小。实验结果表明分类时间减少了85%,而没有损失准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号