Close
Metadata

Identity statement area
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Identifier8JMKD3MGPBW34M/3C9GD5E
Repositorysid.inpe.br/sibgrapi/2012/07.13.03.02
Last Update2012:07.13.03.02.54 roberto.medeiros.souza@gmail.com
Metadatasid.inpe.br/sibgrapi/2012/07.13.03.02.54
Metadata Last Update2020:02.19.02.18.28 administrator
Citation KeySouzaLotuRitt:2012:CoOpFo
TitleA Comparison between Optimum-Path Forest and k-Nearest Neighbors Classifiers
FormatDVD, On-line.
Year2012
Access Date2021, Jan. 28
Number of Files1
Size2170 KiB
Context area
Author1 Souza, Roberto Medeiros de
2 Lotufo, Roberto de Alencar
3 Rittner, Letícia
Affiliation1 UNICAMP
2 UNICAMP
3 UNICAMP
EditorFreitas, Carla Maria Dal Sasso
Sarkar, Sudeep
Scopigno, Roberto
Silva, Luciano
e-Mail Addressroberto.medeiros.souza@gmail.com
Conference NameConference on Graphics, Patterns and Images, 25 (SIBGRAPI)
Conference LocationOuro Preto
DateAug. 22-25, 2012
Book TitleProceedings
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Tertiary TypeFull Paper
History2012-09-20 16:45:34 :: roberto.medeiros.souza@gmail.com -> administrator :: 2012
2020-02-19 02:18:28 :: administrator -> :: 2012
Content and structure area
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Content TypeExternal Contribution
Keywordsk-Nearest Neighbors, Optimum-Path Forest, decision boundaries, classification.
AbstractThis paper presents a comparison between the k- Nearest Neighbors, with an especial focus on the 1-Nearest Neighbor, and the Optimum-Path Forest supervised classifiers. The first was developed in the 1960s, while the second was recently proposed in the 2000s. Although, they were developed around 40 years apart, we can find many similarities between them, especially between 1-Nearest Neighbor and Optimum-Path Forest. This work shows that the Optimum-Path Forest classifier is equivalent to the 1-Nearest Neighbor classifier when all training samples are used as prototypes. The decision boundaries generated by the classifiers are analysed and also some simulations results for both algorithms are presented to compare their performances in real and synthetic data.
source Directory Contentthere are no files
agreement Directory Content
agreement.html 13/07/2012 00:02 0.7 KiB 
Conditions of access and use area
data URLhttp://urlib.net/rep/8JMKD3MGPBW34M/3C9GD5E
zipped data URLhttp://urlib.net/zip/8JMKD3MGPBW34M/3C9GD5E
Languageen
Target File102142.pdf
User Grouproberto.medeiros.souza@gmail.com
Visibilityshown
Allied materials area
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
Notes area
Empty Fieldsaccessionnumber archivingpolicy archivist area callnumber copyholder copyright creatorhistory descriptionlevel dissemination documentstage doi edition electronicmailaddress group holdercode isbn issn label lineage mark nextedition nexthigherunit notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url versiontype volume

Close