A path- and label-cost propagation approach to speedup the training of the optimum-path forest classifier
Nenhuma Miniatura disponível
Data
2014-04-15
Autores
Iwashita, A. S. [UNESP]
Papa, João Paulo [UNESP]
Souza, A. N. [UNESP]
Falcao, A. X.
Lotufo, R. A.
Oliveira, V. M.
Albuquerque, Victor Hugo C. de
Tavares, Joao Manuel R. S.
Título da Revista
ISSN da Revista
Título de Volume
Editor
Elsevier B.V.
Resumo
In general, pattern recognition techniques require a high computational burden for learning the discriminating functions that are responsible to separate samples from distinct classes. As such, there are several studies that make effort to employ machine learning algorithms in the context of big data classification problems. The research on this area ranges from Graphics Processing Units-based implementations to mathematical optimizations, being the main drawback of the former approaches to be dependent on the graphic video card. Here, we propose an architecture-independent optimization approach for the optimum-path forest (OPF) classifier, that is designed using a theoretical formulation that relates the minimum spanning tree with the minimum spanning forest generated by the OPF over the training dataset. The experiments have shown that the approach proposed can be faster than the traditional one in five public datasets, being also as accurate as the original OPF. (C) 2014 Elsevier B. V. All rights reserved.
Descrição
Palavras-chave
Machine learning, Pattern recognition, Optimum-path forest
Como citar
Pattern Recognition Letters. Amsterdam: Elsevier Science Bv, v. 40, p. 121-127, 2014.