In this paper, we compare different methods to map in a optimal way a subset of a finite set S - on which a dissimilarity is defined – on a target set C, on which another dissimilarity is defined. The quality of the mapping is assessed by comparing the dissimilarities of the elements of the target C with the corresponding dissimilarities in S. The closer they are, the better the fit is. Different algorithms are presented and performances are compared.