Publicação: Speeding up optimum-path forest training by path-cost propagation
Carregando...
Data
Orientador
Coorientador
Pós-graduação
Curso de graduação
Título da Revista
ISSN da Revista
Título de Volume
Editor
Tipo
Trabalho apresentado em evento
Direito de acesso
Acesso aberto
Resumo
In this paper we present an optimization of the Optimum-Path Forest classifier training procedure, which is based on a theoretical relationship between minimum spanning forest and optimum-path forest for a specific path-cost function. Experiments on public datasets have shown that the proposed approach can obtain similar accuracy to the traditional one but with faster data training. © 2012 ICPR Org Committee.
Descrição
Palavras-chave
Minimum spanning forests, Optimum-path forests, Software engineering, Pattern recognition
Idioma
Inglês
Como citar
Proceedings - International Conference on Pattern Recognition, p. 1233-1236.
