Comprehensive survey of similarity measures for ranked based location fingerprinting algorithm

Abstract

Ranked Based Fingerprinting uses only ordering indices instead of actual Wi-Fi RSS values in order to make the algorithm insensitive to devices. A key component of the RBF algorithm is a similarity measure which is used to compare and find the closest ranked fingerprints. Previous papers study a few similarity measures; here we study 49 similarity measures in a test with a benchmark with publicly available indoor positioning database. For different similarity measures the positioning accuracy varies from 15.80 m to 55.22 m. The top 3 similarity measures are Lorentzian, Hamming and Jaccard. Hamming and Jaccard similarity measures have been studied in other papers while Lorenzian had not been studied with that kind of problems.