Affiliation:
1. Department of Information Engineering, Electronics and Telecommunications, University of Roma “La Sapienza”, Rome, Italy
2. Department of Business and Management, LUISS University, Rome, Italy
Abstract
In many real-world applications concerning pattern recognition techniques, it is of utmost importance the automatic learning of the most appropriate dissimilarity measure to be used in object comparison. Real-world objects are often complex entities and need a specific representation grounded on a composition of different heterogeneous features, leading to a non-metric starting space where Machine Learning algorithms operate. However, in the so-called unconventional spaces a family of dissimilarity measures can be still exploited, that is, the set of component-wise dissimilarity measures, in which each component is treated with a specific sub-dissimilarity that depends on the nature of the data at hand. These dissimilarities are likely to be non-Euclidean, hence the underlying dissimilarity matrix is not isometrically embeddable in a standard Euclidean space because it may not be structurally rich enough. On the other hand, in many metric learning problems, a component-wise dissimilarity measure can be defined as a weighted linear convex combination and weights can be suitably learned. This article, after introducing some hints on the relation between distances and the metric learning paradigm, provides a discussion along with some experiments on how weights, intended as mathematical operators, interact with the Euclidean behavior of dissimilarity matrices.
Reference64 articles.
1. Learning distance functions using equivalence relations;Bar-Hillel;Proceedings of the 20th International Conference on Machine Learning (ICML-03),2003
2. Foundations of multidimensional scaling;Beals;Psychological Review,1968
3. Laplacian eigenmaps for dimensionality reduction and data representation;Belkin;Neural Computation,2003
4. A survey on metric learning for feature vectors and structured data;Bellet;ArXiv,2013
5. Representation learning: a review and new perspectives;Bengio;IEEE Transactions on Pattern Analysis and Machine Intelligence,2013
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献