Clustering-Based Reference Set Reduction for k-Nearest Neighbor

  • Authors:
  • Seongseob Hwang;Sungzoon Cho

  • Affiliations:
  • Seoul National University, San 56-1, Shillim-dong, Kwanak-gu, 151-744, Seoul, Korea;Seoul National University, San 56-1, Shillim-dong, Kwanak-gu, 151-744, Seoul, Korea

  • Venue:
  • ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.