1 Introduction
Distance measuring has been used to find the similarity between the query data point and other samples in the dataset. The calculated distance can be applied in various machine learning algorithms to make predictions. However, pointsets, which have been widely used for representing documents [1], graphs (as a set of vertex embeddings) [2], and 3D models (point clouds) [3], require a complex distance function to compute a distance between each sample. In particular, one of the effective distribution distances for pointsets called Earth Mover’s Distance (EMD) [4] requires O(n^3\log n) per one comparison. Deep metric learning can alleviate this high computation cost problem by encoding raw pointsets into new representations in a euclidean space with a lower distance measuring cost. Several studies proved that deep metric learning approaches achieve state-of-the-art results in various tasks, including image retrieval [5], [6], face recognition [7], [8], [9], person re-identification [10], [11], trajectory similarity search [12], and pointsets similarity search [13] in terms of classification accuracy and computation cost. However, these techniques mostly require supervision, which cannot be applied to unlabeled data.