Advanced search
Start date
Betweenand
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Optimum-Path Forest based on k-connectivity: Theory and applications

Full text
Author(s):
Papa, Joao Paulo ; Nachif Fernandes, Silas Evandro ; Falcao, Alexandre Xavier
Total Authors: 3
Document type: Journal article
Source: PATTERN RECOGNITION LETTERS; v. 87, n. SI, p. 117-126, FEB 1 2017.
Web of Science Citations: 16
Abstract

Graph-based pattern recognition techniques have been in the spotlight for many years, since there is a constant need for faster and more effective approaches. Among them, the Optimum-Path Forest (OPF) framework has gained considerable attention in the last years, mainly due to the promising results obtained by OPF-based classifiers, which range from unsupervised, semi-supervised and supervised learning. In this paper, we consider a deeper theoretical explanation concerning the supervised OPF classifier with k-neighborhood (OPFk), as well as we proposed two different training and classification algorithms that allow OPFk to work faster. The experimental validation against standard OPF and Support Vector Machines also validates the robustness of OPFk in real and synthetic datasets. (C) 2016 Elsevier B.V. All rights reserved. (AU)

FAPESP's process: 14/16250-9 - On the parameter optimization in machine learning techniques: advances and paradigms
Grantee:João Paulo Papa
Support type: Regular Research Grants
FAPESP's process: 13/20387-7 - Hyperparameter optimization in deep learning arquitectures
Grantee:João Paulo Papa
Support type: Scholarships abroad - Research
FAPESP's process: 09/16206-1 - New trends on optimum-path forest-based pattern recognition
Grantee:João Paulo Papa
Support type: Research Grants - Young Investigators Grants