Augmented Embedding of Dissimilarity Data into (Pseudo-)Euclidean Spaces

  • Artsiom Harol
  • Elżbieta Pękalska
  • Sergey Verzakov
  • Robert P. W. Duin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4109)


Pairwise proximities describe the properties of objects in terms of their similarities. By using different distance-based functions one may encode different characteristics of a given problem. However, to use the framework of statistical pattern recognition some vector representation should be constructed. One of the simplest ways to do that is to define an isometric embedding to some vector space. In this work, we will focus on a linear embedding into a (pseudo-)Euclidean space.

This is usually well defined for training data. Some inadequacy, however, appears when projecting new or test objects due to the resulting projection errors. In this paper we propose an augmented embedding algorithm that enlarges the dimensionality of the space such that the resulting projection error vanishes. Our preliminary results show that it may lead to a better classification accuracy, especially for data with high intrinsic dimensionality.


Isometric Embedding Projection Error Linear Embedding Statistical Pattern Recognition Radar Return 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Pekalska, E., Duin, R.P.W.: The Dissimilarity Representation for Pattern Recognition. Foundations and Applications. World Scientific, Singapore (2005)MATHCrossRefGoogle Scholar
  2. 2.
    Andreu, G., Crespo, A., Valiente, J.M.: Selecting the toroidal self-organizing feature maps (TSOFM) best organized to object recognition. In: Proceedings of ICNN 1997, Houston, Texas (USA), vol. 2, pp. 1341–1346. IEEE, Los Alamitos (1997)Google Scholar
  3. 3.
    Pekalska, E., Paclik, P., Duin, R.P.W.: A generalized kernel approach to dissimilarity based classification. Journal of Machine Learning Research 2, 175–211 (2002)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Goldfarb, L.: A New Approach to Pattern Recognition. Progress in Pattern Recognition 2, 241–402 (1985)MathSciNetGoogle Scholar
  5. 5.
    Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Sciences (1998),
  6. 6.
    Spillmann, B.: Description of the Distance Matrices, University of Bern, Institute of Computer Science and Applied Mathematics, Computer Vision and Artificial Intelligence (FKI) (2004)Google Scholar
  7. 7.
    Borg, I., Groenen, P.: Modern Multidimensional Scaling. Springer, Heidelberg (1997)MATHGoogle Scholar
  8. 8.
    Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman & Hall, Boca Raton (1994)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Artsiom Harol
    • 1
  • Elżbieta Pękalska
    • 2
  • Sergey Verzakov
    • 1
  • Robert P. W. Duin
    • 1
  1. 1.Information and Communication Theory group, Faculty of Electrical Engineering, Mathematics and Computer ScienceDelft University of TechnologyThe Netherlands
  2. 2.School of Computer ScienceUniversity of ManchesterUnited Kingdom

Personalised recommendations