Back to Search Start Over

Clustering-Based Reference Set Reduction for k-Nearest Neighbor.

Authors :
Hutchison, David
Kanade, Takeo
Kittler, Josef
Kleinberg, Jon M.
Mattern, Friedemann
Mitchell, John C.
Naor, Moni
Nierstrasz, Oscar
Rangan, C. Pandu
Steffen, Bernhard
Sudan, Madhu
Terzopoulos, Demetri
Tygar, Doug
Vardi, Moshe Y.
Weikum, Gerhard
Liu, Derong
Fei, Shumin
Hou, Zengguang
Zhang, Huaguang
Sun, Changyin
Source :
Advances in Neural Networks: ISNN 2007; 2007, p880-888, 9p
Publication Year :
2007

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. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783540723929
Database :
Complementary Index
Journal :
Advances in Neural Networks: ISNN 2007
Publication Type :
Book
Accession number :
33198867
Full Text :
https://doi.org/10.1007/978-3-540-72393-6_105