Relational discriminant analysis

Relational discriminant analysis is based on a proximity description of the data. Instead of features, the similarities to a subset of the objects in the training data are used for representation. In this paper we will show that this subset might be small and that its exact choice is of minor importance. Moreover, it is shown that linear or non-linear methods for feature extraction based on multi-dimensional scaling are not, or just hardly better than subsets. Selection dras- tically simplifies the problem of dimension reduction. Relational discriminant analysis may thus be a valuable pattern recognition tool for applications in which the choice of the features is uncertain. " 1999 Elsevier Science B.V. All rights reserved.

[1]  Robert P. W. Duin.  Relational discriminant analysis and its large sample size problem , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[2]  John W. Sammon,et al.  A Nonlinear Mapping for Data Structure Analysis , 1969, IEEE Transactions on Computers.

[3]  Heinrich Niemann,et al.  Linear and nonlinear mapping of patterns , 1980, Pattern Recognit..

[4]  Robert P. W. Duin,et al.  Experiments with a featureless approach to pattern recognition , 1997, Pattern Recognit. Lett..

[5]  Anil K. Jain,et al.  39 Dimensionality and sample size considerations in pattern recognition practice , 1982, Classification, Pattern Recognition and Reduction of Dimensionality.

[6]  Robert P. W. Duin,et al.  Neural network experiences between perceptrons and support vectors , 1997, BMVC.

[7]  Robert P. W. Duin,et al.  Support objects for domain approximation , 1998 .