Please use this identifier to cite or link to this item:
|Title:||Optimum-path Forest Based On K-connectivity: Theory And Applications|
Joao Paulo; Nachif Fernandes
Silas Evandro; Falcao
|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.|
|Editor:||Elsevier Science BV|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.