By Topic

About Neighborhood Counting Measure Metric and Minimum Risk Metric

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Argentini, A. ; Dipt. di Ing. e Scienza dell'Inf., Univ. di Trento, Trento, Italy ; Blanzieri, E.

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.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:32 ,  Issue: 4 )