Neighborhood Counting Measure and Minimum Risk Metric

The neighborhood counting measure is a similarity measure based on the counting of all common neighborhoods in a data space. The minimum risk metric (MRM) is a distance measure based on the minimization of the risk of misclassification. The paper by Argentini and Blanzieri refutes a remark about the time complexity of MRM, and presents an experimental comparison of MRM and NCM. This paper is a response to the paper by Argentini and Blanzieri. The original remark is clarified by a combination of theoretical analysis of different implementations of MRM and experimental comparison of MRM and NCM using straightforward implementations of the two measures.

[1]  Hui Wang,et al.  Nearest neighbors by neighborhood counting , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Hui Wang,et al.  All Common Subsequences , 2007, IJCAI.

[3]  S. McClean,et al.  All Common Embedded Subtrees for Measuring Tree Similarity , 2008, 2008 International Symposium on Computational Intelligence and Design.

[4]  Zhiwei Lin,et al.  A Time Weighted Neighbourhood Counting Similarity for Time Series Analysis , 2008, RSKT.

[5]  Enrico Blanzieri,et al.  About Neighborhood Counting Measure Metric and Minimum Risk Metric , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Sven Rahmann,et al.  Algorithms for subsequence combinatorics , 2008, Theor. Comput. Sci..

[7]  Francesco Ricci,et al.  Probability Based Metrics for Nearest Neighbor Classification and Case-Based Reasoning , 1999, ICCBR.