<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<identifier>8JMKD3MGPAW/3RMKREB</identifier>
		<repository>sid.inpe.br/sibgrapi/2018/08.24.16.54</repository>
		<metadatarepository>sid.inpe.br/sibgrapi/2018/08.24.16.54.46</metadatarepository>
		<site>sibgrapi.sid.inpe.br 802</site>
		<citationkey>MonteroFalc:2018:DiClAp</citationkey>
		<author>Montero, Adán Echemendía,</author>
		<author>Falcão, Alexandre Xavier,</author>
		<affiliation>Laboratory of Image Data Science, Institute of Computing, University of Campinas</affiliation>
		<affiliation>Laboratory of Image Data Science, Institute of Computing, University of Campinas</affiliation>
		<title>A Divide-and-Conquer Clustering Approach based on Optimum-Path Forest</title>
		<conferencename>Conference on Graphics, Patterns and Images, 31 (SIBGRAPI)</conferencename>
		<year>2018</year>
		<editor>Ross, Arun,</editor>
		<editor>Gastal, Eduardo S. L.,</editor>
		<editor>Jorge, Joaquim A.,</editor>
		<editor>Queiroz, Ricardo L. de,</editor>
		<editor>Minetto, Rodrigo,</editor>
		<editor>Sarkar, Sudeep,</editor>
		<editor>Papa, João Paulo,</editor>
		<editor>Oliveira, Manuel M.,</editor>
		<editor>Arbeláez, Pablo,</editor>
		<editor>Mery, Domingo,</editor>
		<editor>Oliveira, Maria Cristina Ferreira de,</editor>
		<editor>Spina, Thiago Vallin,</editor>
		<editor>Mendes, Caroline Mazetto,</editor>
		<editor>Costa, Henrique Sérgio Gutierrez,</editor>
		<editor>Mejail, Marta Estela,</editor>
		<editor>Geus, Klaus de,</editor>
		<editor>Scheer, Sergio,</editor>
		<booktitle>Proceedings</booktitle>
		<date>Oct. 29 - Nov. 1, 2018</date>
		<publisheraddress>Los Alamitos</publisheraddress>
		<publisher>IEEE Computer Society</publisher>
		<conferencelocation>Foz do Iguaçu, PR, Brazil</conferencelocation>
		<keywords>clustering, optimum-path forest, image segmentation, image foresting transform, divide-and-conquer.</keywords>
		<abstract>Data clustering is one of the main challenges when solving Data Science problems. Despite its progress over almost one century of research, clustering algorithms still fail in identifying groups naturally related to the semantics of the problem. Moreover, the technological advances add crucial challenges with a considerable data increase, which are not handled by most techniques. We address these issues by proposing a divide-and-conquer approach to a clustering technique, which is unique in finding one group per dome of the probability density function of the data --- the Optimum-Path Forest (OPF) clustering algorithm. Our approach can use all samples, or at least many samples, in the unsupervised learning process without affecting the grouping performance and, therefore, being less likely to lose relevant grouping information. We show that it can obtain satisfactory results when segmenting natural images into superpixels.</abstract>
		<language>en</language>
		<tertiarytype>Full Paper</tertiarytype>
		<format>On-line</format>
		<size>3527 KiB</size>
		<numberoffiles>1</numberoffiles>
		<targetfile>34.pdf</targetfile>
		<lastupdate>2018:08.24.16.54.46 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatalastupdate>2020:02.19.03.10.44 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2018}</metadatalastupdate>
		<mirrorrepository>sid.inpe.br/banon/2001/03.30.15.38.24</mirrorrepository>
		<e-mailaddress>aemontero7@gmail.com</e-mailaddress>
		<usergroup>aemontero7@gmail.com</usergroup>
		<visibility>shown</visibility>
		<transferableflag>1</transferableflag>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<contenttype>External Contribution</contenttype>
		<documentstage>not transferred</documentstage>
		<nexthigherunit>8JMKD3MGPAW/3RPADUS</nexthigherunit>
		<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/2018/08.24.16.54</url>
	</metadata>
</metadatalist>