Feature-based dissimilarity space classification

  • Authors:
  • Robert P. W. Duin;Marco Loog;Elżbieta Pekalska;David M. J. Tax

  • Affiliations:
  • Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology, The Netherlands;School of Computer Science, University of Manchester, United Kingdom;Faculty of Electrical Engineering, Mathematics and Computer Sciences, Delft University of Technology, The Netherlands

  • Venue:
  • ICPR'10 Proceedings of the 20th International conference on Recognizing patterns in signals, speech, images, and videos
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [1,2]. They often arise in problems in which direct comparisons of objects are made by computing pairwise distances between images, spectra, graphs or strings. Dissimilarity-based classifiers can also be defined in vector spaces [3]. A large comparative study has not been undertaken so far. This paper compares dissimilarity-based classifiers with traditional feature-based classifiers, including linear and nonlinear SVMs, in the context of the ICPR 2010 Classifier Domains of Competence contest. It is concluded that the feature-based dissimilarity space classification performs similar or better than the linear and nonlinear SVMs, as averaged over all 301 datasets of the contest and in a large subset of its datasets. This indicates that these classifiers have their own domain of competence.