Relational discriminant analysis and its large sample size problem

Relational discriminant analysis is based on a similarity matrix of the training set. It is able to construct reliable nonlinear discriminants in infinite dimensional feature spaces based on small training sets. This technique has a large sample size problem as the size of the similarity matrix equals the square of the number of objects in the training set. We discuss and initially evaluate a solution that drastically decreases training times and memory demands