Skip to Main Content
In a 2006 TPAMI paper, Wang proposed the neighborhood counting measure, a similarity measure for the k-NN algorithm. In his paper, Wang mentioned the minimum risk metric (MRM,), an early distance measure based on the minimization of the risk of misclassification. Wang did not compare NCM to MRM because of its allegedly excessive computational load. In this comment paper, we complete the comparison that was missing in Wang's paper and, from our empirical evaluation, we show that MRM outperforms NCM and that its running time is not prohibitive as Wang suggested.