Close
Metadata

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPBW34M/3A35MF5
Repositorysid.inpe.br/sibgrapi/2011/07.07.15.14
Last Update2011:07.07.15.14.55 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2011/07.07.15.14.55
Metadata Last Update2022:06.14.00.07.09 (UTC) administrator
DOI10.1109/SIBGRAPI.2011.25
Citation KeyNakamuraPerePapaFalc:2011:OpFoPr
TitleOptimum-path forest pruning parameter estimation through harmony search
FormatDVD, On-line.
Year2011
Access Date2025, Mar. 21
Number of Files1
Size199 KiB
2. Context
Author1 Nakamura, Rodrigo Yuji Mizobe
2 Pereira, Clayton Reginaldo
3 Papa, Joao Paulo
4 Falcao, Alexandre Xavier
Affiliation1 UNESP - Univ Estadual Paulista
2 UNESP - Univ Estadual Paulista
3 UNESP - Univ Estadual Paulista
4 University of Campinas
EditorLewiner, Thomas
Torres, Ricardo
e-Mail Addresspapa.joaopalo@gmail.com
Conference NameConference on Graphics, Patterns and Images, 24 (SIBGRAPI)
Conference LocationMaceió, AL, Brazil
Date28-31 Aug. 2011
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2011-07-23 15:36:12 :: papa.joaopalo@gmail.com -> administrator :: 2011
2022-06-14 00:07:09 :: administrator -> :: 2011
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
KeywordsOptimum-Path Forest
Supervised classification
Pattern Recognition
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.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2011 > Optimum-path forest pruning...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Optimum-path forest pruning...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 07/07/2011 12:14 0.5 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPBW34M/3A35MF5
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3A35MF5
Languageen
Target Filefinal_paper.pdf
User Grouppapa.joaopalo@gmail.com
Visibilityshown
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPEW34M/46SKNPE
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/05.15.00.56 44
sid.inpe.br/sibgrapi/2022/06.10.21.49 5
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close