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

Autor(es)

Papa, Joao Paulo ; Nachif Fernandes, Silas Evandro ; Falcao, Alexandre Xavier

• Tipo de documento: Artigo Científico
• Fonte: PATTERN RECOGNITION LETTERS; v. 87, p. 10-pg., 2017-02-01.

Resumo

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)

• Processo FAPESP: 14/16250-9 - Sobre a otimização de parâmetros em técnicas de aprendizado de máquina: avanços e paradigmas
• Beneficiário: João Paulo Papa
• Modalidade de apoio: Auxílio à Pesquisa - Regular
• Processo FAPESP: 09/16206-1 - Novas tendências em reconhecimento de padrões baseado em floresta de caminhos ótimos
• Beneficiário: João Paulo Papa
• Modalidade de apoio: Auxílio à Pesquisa - Jovens Pesquisadores
• Processo FAPESP: 13/20387-7 - Otimização de hiperparâmetros em arquiteturas de aprendizado em profundidade
• Beneficiário: João Paulo Papa
• Modalidade de apoio: Bolsas no Exterior - Pesquisa