Similarity measures for multidimensional data

• Published in: 2011 IEEE 27th International Conference on Data Engineering pp. 171 - 182
• Main Authors: Baikousi, E, Rogkakos, G, Vassiliadis, P
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-04-2011
• Subjects: Cities and towns; Computer science; Europe; Lattices; Taxonomy; USA Councils; Weight measurement
• DOI: 10.1109/ICDE.2011.5767869
• EISSN: 2375-026X
• ISBN: 9781424489596; 1424489598
• ISSN: 1063-6382

How similar are two data-cubes? In other words, the question under consideration is: given two sets of points in a multidimensional hierarchical space, what is the distance value between them? In this paper we explore various distance functions that can be used over multidimensional hierarchical spaces. We organize the discussed functions with respect to the properties of the dimension hierarchies, levels and values. In order to discover which distance functions are more suitable and meaningful to the users, we conducted two user study analysis. The first user study analysis concerns the most preferred distance function between two values of a dimension. The findings of this user study indicate that the functions that seem to fit better the user needs are characterized by the tendency to consider as closest to a point in a multidimensional space, points with the smallest shortest path with respect to the same dimension hierarchy. The second user study aimed in discovering which distance function between two data cubes, is mostly preferred by users. The two functions that drew the attention of users where (a) the summation of distances between every cell of a cube with the most similar cell of another cube and (b) the Hausdorff distance function. Overall, the former function was preferred by users than the latter; however the individual scores of the tests indicate that this advantage is rather narrow.