Taxonomy of classifiers based on dissimilarity features

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free