A great number of linear and nonlinear classification algorithms can follow from a general representation of discriminant function written as a weighted sum of kernel functions of dissimilarity features. Unified look at the algorithms allows obtaining intermediate classifiers which after tuning of the weights and other model's parameters can outperform popular dissimilarity based methods. Simulations with artificial and real world data sets revealed efficiency of single layer perceptron trained in a special way. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Raudys, S. (2005). Taxonomy of classifiers based on dissimilarity features. In Lecture Notes in Computer Science (Vol. 3686, pp. 136–145). Springer Verlag. https://doi.org/10.1007/11551188_15
Mendeley helps you to discover research relevant for your work.