An Empirical Study on the Performance of the Distance Metrics

Authors : Fatih Aydin

Pages : 1445-1457

Doi:10.35414/akufemubid.1325843

View : 69 | Download : 64

Publication Date : 2023-12-28

Article Type : Research Paper

Abstract :Metrics are used to measure the distance, similarity, or dissimilarity between two points in a metric space. Metric learning algorithms perform the finding task of data points that are closest or furthest to a query point in m-dimensional metric space. Some metrics take into account the assumption that the whole dimensions are of equal importance, and vice versa. However, this assumption does not incorporate a number of real-world problems that classification algorithms tackle. In this research, the existing information gain, the information gain ratio, and some well-known conventional metrics have been compared by each other. The 1-Nearest Neighbor algorithm taking these metrics as its meta-parameter has been applied to forty-nine benchmark datasets. Only the accuracy rate criterion has been employed in order to quantify the performance of the metrics. The experimental results show that each metric is successful on datasets corresponding to its own domain. In other words, each metric is favorable on datasets overlapping its own assumption. In addition, there also exists incompleteness in classification tasks for metrics just like there is for learning algorithms.
Keywords : Makine öğrenmesi, Metrik öğrenme, Bilgi kazancı, No free lunch teoremleri, K en yakın komşular