Nearest Neighbor-based Importance Weighting
Lists
Only you see this
Abstract
Importance weighting is widely applicable in machine learning in general and in techniques dealing with data covariate shift problems in particular. A novel, direct approach to determine such importance weighting is presented. It relies on a nearest neighbor classification scheme and is relatively straightforward to implement. Comparative experiments on various classification tasks demonstrate the effectiveness of our so-called nearest neighbor weighting (NNeW) scheme. Considering its performance, our procedure can act as a simple and effective baseline method for importance weighting.
BibTeX
@inproceedings{loog2012nearest,
author = {Marco Loog},
title = {{Nearest Neighbor-based Importance Weighting}},
booktitle = {MLSP},
year = {2012},
url = {https://openreview.net/forum?id=93I4pr9hU8},
}Loading related content...