A generalization of dissimilarity representations using feature lines and feature planes

  • Authors:
  • Mauricio Orozco-Alzate;Robert P. W. Duin;Germán Castellanos-Domínguez

  • Affiliations:
  • Departamento de Informática y Computación, Universidad Nacional de Colombia Sede Manizales, Kilómetro 7 Vía al Aeropuerto, Campus La Nubia - Bloque Q, Piso 2, Manizales (Caldas ...;Information and Communication Theory Group, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, 2600GA Delft, The Netherlands;Grupo de Control y Procesamiento Digital de Señales, Universidad Nacional de Colombia Sede Manizales, Kilómetro 7 Vía al Aeropuerto, Campus La Nubia - Bloque Q, Piso 2, Manizales (C ...

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.10

Visualization

Abstract

Even though, under representational restrictions, the nearest feature rules and the dissimilarity-based classifiers are feasible alternatives to the nearest neighbor method; individually, they may not be sufficiently powerful if a very small set of prototypes is required, e.g. when it is computationally expensive to deal with larger sets of prototypes. In this paper, we show that combining both strategies, taking advantage of their individual properties, provides an improvement, particularly for correlated data sets. The combined strategy consists in deriving an enriched (generalized) dissimilarity representation by using the nearest feature rules, namely feature lines and feature planes. On top of that enriched representation, Bayesian classifiers can be constructed in order to obtain a good generalization.