Publicação: Speeding up optimum-path forest training by path-cost propagation
dc.contributor.author | Iwashita, Adriana S. [UNESP] | |
dc.contributor.author | Papa, João Paulo [UNESP] | |
dc.contributor.author | Falcao, Alexandre X. | |
dc.contributor.author | Lotufo, Roberto A. | |
dc.contributor.author | De Araujo Oliveira, Victor M. | |
dc.contributor.author | De Albuquerque, Victor H. Costa | |
dc.contributor.author | Tavares, Joao Manuel R. S. | |
dc.contributor.institution | Universidade Estadual Paulista (Unesp) | |
dc.contributor.institution | Universidade Estadual de Campinas (UNICAMP) | |
dc.contributor.institution | University of Fortaleza | |
dc.contributor.institution | University of Porto | |
dc.date.accessioned | 2014-05-27T11:27:22Z | |
dc.date.available | 2014-05-27T11:27:22Z | |
dc.date.issued | 2012-12-01 | |
dc.description.abstract | 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. | en |
dc.description.affiliation | São Paulo State University Department of Computing, Bauru | |
dc.description.affiliation | University of Campinas Institute of Computing, Campinas | |
dc.description.affiliation | University of Campinas School of Electrical and Computer Engineering, Campinas | |
dc.description.affiliation | Center of Technological Sciences University of Fortaleza, Fortaleza | |
dc.description.affiliation | Faculty of Engineering University of Porto, Porto | |
dc.description.affiliationUnesp | São Paulo State University Department of Computing, Bauru | |
dc.format.extent | 1233-1236 | |
dc.identifier | http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6460361 | |
dc.identifier.citation | Proceedings - International Conference on Pattern Recognition, p. 1233-1236. | |
dc.identifier.issn | 1051-4651 | |
dc.identifier.lattes | 9039182932747194 | |
dc.identifier.scopus | 2-s2.0-84874569486 | |
dc.identifier.uri | http://hdl.handle.net/11449/73946 | |
dc.language.iso | eng | |
dc.relation.ispartof | Proceedings - International Conference on Pattern Recognition | |
dc.relation.ispartofsjr | 0,307 | |
dc.rights.accessRights | Acesso aberto | |
dc.source | Scopus | |
dc.subject | Minimum spanning forests | |
dc.subject | Optimum-path forests | |
dc.subject | Software engineering | |
dc.subject | Pattern recognition | |
dc.title | Speeding up optimum-path forest training by path-cost propagation | en |
dc.type | Trabalho apresentado em evento | |
dcterms.license | http://www.ieee.org/publications_standards/publications/rights/rights_policies.html | |
dspace.entity.type | Publication | |
unesp.author.lattes | 9039182932747194 | |
unesp.campus | Universidade Estadual Paulista (UNESP), Faculdade de Ciências, Bauru | pt |
unesp.department | Computação - FC | pt |