1. A computer-implemented method, comprising: obtaining a plurality of labeled samples for a plurality of classes; performing, by a processor, a series of operations at least one time, the operations comprising: for each class of the plurality of classes: generating a point Y based upon at least one sample in the class having a class label different than a class label of each of k nearest neighbors of the at least one sample , wherein k is not less than 1 ; and adding the point Y to the set; identifying a nearest neighbor of a submitted point in the set; and outputting the nearest neighbor as a candidate for the submitted point.