You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72865
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNakamura, Rodrigo Yuji Mizobe-
dc.contributor.authorClayton, Reginaldo Pereira-
dc.contributor.authorPapa, João Paulo-
dc.contributor.authorFalcão, Alexandre Xavier-
dc.date.accessioned2014-05-27T11:26:14Z-
dc.date.accessioned2016-10-25T18:35:53Z-
dc.date.available2014-05-27T11:26:14Z-
dc.date.available2016-10-25T18:35:53Z-
dc.date.issued2011-12-01-
dc.identifierhttp://dx.doi.org/10.1109/SIBGRAPI.2011.25-
dc.identifier.citationProceedings - 24th SIBGRAPI Conference on Graphics, Patterns and Images, p. 181-188.-
dc.identifier.urihttp://hdl.handle.net/11449/72865-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/72865-
dc.description.abstractPattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest classifier was proposed to overcome such limitations, together with its training set pruning algorithm, which requires a parameter that has been empirically set up to date. In this paper, we propose a Harmony Search-based algorithm that can find near optimal values for that. The experimental results have showed that our algorithm is able to find proper values for the OPF pruning algorithm parameter. © 2011 IEEE.en
dc.format.extent181-188-
dc.language.isoeng-
dc.sourceScopus-
dc.subjectOptimum-Path Forest-
dc.subjectPattern Recognition-
dc.subjectSupervised classification-
dc.subjectClassification system-
dc.subjectForest classifiers-
dc.subjectHarmony search-
dc.subjectOptimal values-
dc.subjectPruning algorithms-
dc.subjectReal time-
dc.subjectSearch-based algorithms-
dc.subjectTraining sets-
dc.subjectAlgorithms-
dc.subjectClassification (of information)-
dc.subjectForestry-
dc.subjectPattern recognition-
dc.subjectParameter estimation-
dc.subjectInformation Retrieval-
dc.titleOptimum-Path Forest pruning parameter estimation through Harmony Searchen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.contributor.institutionUniversidade Estadual de Campinas (UNICAMP)-
dc.description.affiliationDepartment of Computing Universidade Estadual Paulista (UNESP), Bauru, São Paulo-
dc.description.affiliationInstitute of Computing University of Campinas, Campinas, São Paulo-
dc.description.affiliationUnespDepartment of Computing Universidade Estadual Paulista (UNESP), Bauru, São Paulo-
dc.identifier.doi10.1109/SIBGRAPI.2011.25-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofProceedings - 24th SIBGRAPI Conference on Graphics, Patterns and Images-
dc.identifier.scopus2-s2.0-84857188160-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
Show simple item record Show full item record   View Statistics
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.