We present an approach for supervised pattern recognition based on combinatorial analysis of optimum paths from key samples (prototypes), which creates a discrete optimal partition of the feature space such that any unknown sample can be classified according to this partition. A training set is interpreted as a complete graph with at least one prototype in each class. They compete among themselves and each prototype defines an optimum-path tree, whose nodes are the samples more strongly connected to it than to any other. The result is an optimum-path forest in the training set. A test sample is assigned to the class of the prototype which offers it the optimum path in the forest. The classifier is designed to achieve zero classification errors in the training set, without over-fitting, and to learn from its errors. A comparison with several datasets shows the advantages of the method in accuracy and efficiency with respect to support vector machines. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Papa, J. P., Falcão, A. X., Suzuki, C. T. N., & Mascarenhas, N. D. A. (2008). A discrete approach for supervised pattern recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4958 LNCS, pp. 136–147). Springer Verlag. https://doi.org/10.1007/978-3-540-78275-9_12
Mendeley helps you to discover research relevant for your work.