The Community for Technology Leaders
Green Image
Issue No. 09 - September (2010 vol. 22)
ISSN: 1041-4347
pp: 1274-1285
Sergey Feldman , University of Washington, Seattle
Eric K. Garcia , University of Washington, Seattle
Santosh Srivastava , Fred Hutchinson Cancer Research Center, Seattle
Maya R. Gupta , University of Washington, Seattle
ABSTRACT
Local classifiers are sometimes called lazy learners because they do not train a classifier until presented with a test sample. However, such methods are generally not completely lazy because the neighborhood size k (or other locality parameter) is usually chosen by cross validation on the training set, which can require significant preprocessing and risks overfitting. We propose a simple alternative to cross validation of the neighborhood size that requires no preprocessing: instead of committing to one neighborhood size, average the discriminants for multiple neighborhoods. We show that this forms an expected estimated posterior that minimizes the expected Bregman loss with respect to the uncertainty about the neighborhood choice. We analyze this approach for six standard and state-of-the-art local classifiers, including discriminative adaptive metric kNN (DANN), a local support vector machine (SVM-KNN), hyperplane distance nearest neighbor (HKNN), and a new local Bayesian quadratic discriminant analysis (local BDA). The empirical effectiveness of this technique versus cross validation is confirmed with experiments on seven benchmark data sets, showing that similar classification performance can be attained without any training.
INDEX TERMS
Lazy learning, Bayesian estimation, cross validation, local learning, quadratic discriminant analysis.
CITATION
Sergey Feldman, Eric K. Garcia, Santosh Srivastava, Maya R. Gupta, "Completely Lazy Learning", IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 1274-1285, September 2010, doi:10.1109/TKDE.2009.159
114 ms
(Ver 3.1 (10032016))