Dimensionality Invariant Similarity Measure
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Sep 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 1; 2025: 1.
4 papers.
- 2021Fidelity and Privacy of Synthetic Medical Datacited by 16
- 2022Stop Oversampling for Class Imbalance Learning: A Critical Reviewcited by 4
- 2024A Guide to Similarity Measurescited by 4
- 2025KNN and K-means in Gini Prametric Spacescited by 2
- 2025KNN and K-means in Gini Prametric Spaces29 Jan 2025
- 2024A Guide to Similarity Measures7 Aug 2024
- 2022Stop Oversampling for Class Imbalance Learning: A Critical Review4 Feb 2022
- 2021Fidelity and Privacy of Synthetic Medical Data18 Jan 2021