<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<identifier>8JMKD3MGPBW34M/3A35MF5</identifier>
		<repository>sid.inpe.br/sibgrapi/2011/07.07.15.14</repository>
		<metadatarepository>sid.inpe.br/sibgrapi/2011/07.07.15.14.55</metadatarepository>
		<site>sibgrapi.sid.inpe.br 802</site>
		<citationkey>NakamuraPerePapaFalc:2011:OpFoPr</citationkey>
		<author>Nakamura, Rodrigo Yuji Mizobe,</author>
		<author>Pereira, Clayton Reginaldo,</author>
		<author>Papa, Joao Paulo,</author>
		<author>Falcao, Alexandre Xavier,</author>
		<affiliation>UNESP - Univ Estadual Paulista</affiliation>
		<affiliation>UNESP - Univ Estadual Paulista</affiliation>
		<affiliation>UNESP - Univ Estadual Paulista</affiliation>
		<affiliation>University of Campinas</affiliation>
		<title>Optimum-path forest pruning parameter estimation through harmony search</title>
		<conferencename>Conference on Graphics, Patterns and Images, 24 (SIBGRAPI)</conferencename>
		<year>2011</year>
		<editor>Lewiner, Thomas,</editor>
		<editor>Torres, Ricardo,</editor>
		<booktitle>Proceedings</booktitle>
		<date>Aug. 28 - 31, 2011</date>
		<publisheraddress>Los Alamitos</publisheraddress>
		<publisher>IEEE Computer Society</publisher>
		<conferencelocation>Maceió</conferencelocation>
		<keywords>Optimum-Path Forest, Supervised classification, Pattern Recognition.</keywords>
		<abstract>Pattern 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.</abstract>
		<language>en</language>
		<tertiarytype>Full Paper</tertiarytype>
		<format>DVD, On-line.</format>
		<size>199 KiB</size>
		<numberoffiles>1</numberoffiles>
		<targetfile>final_paper.pdf</targetfile>
		<lastupdate>2011:07.07.15.14.55 sid.inpe.br/banon/2001/03.30.15.38 papa.joaopalo@gmail.com</lastupdate>
		<metadatalastupdate>2020:02.19.02.19.26 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2011}</metadatalastupdate>
		<mirrorrepository>sid.inpe.br/banon/2001/03.30.15.38.24</mirrorrepository>
		<e-mailaddress>papa.joaopalo@gmail.com</e-mailaddress>
		<usergroup>papa.joaopalo@gmail.com</usergroup>
		<visibility>shown</visibility>
		<transferableflag>1</transferableflag>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<contenttype>External Contribution</contenttype>
		<agreement>agreement.html .htaccess .htaccess2</agreement>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi/2011/07.07.15.14</url>
	</metadata>
</metadatalist>