pith. sign in

arxiv: 1409.0923 · v1 · pith:U4NJW57Nnew · submitted 2014-09-02 · 💻 cs.LG

Dimensionality Invariant Similarity Measure

classification 💻 cs.LG
keywords measuremetricproposedsimilarityapplicationsclassifierinvariantsome
0
0 comments X
read the original abstract

This paper presents a new similarity measure to be used for general tasks including supervised learning, which is represented by the K-nearest neighbor classifier (KNN). The proposed similarity measure is invariant to large differences in some dimensions in the feature space. The proposed metric is proved mathematically to be a metric. To test its viability for different applications, the KNN used the proposed metric for classifying test examples chosen from a number of real datasets. Compared to some other well known metrics, the experimental results show that the proposed metric is a promising distance measure for the KNN classifier with strong potential for a wide range of applications.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.