How far you can get using machine learning black-boxes
| dc.contributor.author | Rocha, Anderson | |
| dc.contributor.author | Papa, João Paulo [UNESP] | |
| dc.contributor.author | Meira, Luis A. A. | |
| dc.contributor.institution | Universidade Estadual de Campinas (UNICAMP) | |
| dc.contributor.institution | Universidade Estadual Paulista (UNESP) | |
| dc.contributor.institution | Universidade de São Paulo (USP) | |
| dc.date.accessioned | 2022-04-28T22:25:17Z | |
| dc.date.available | 2022-04-28T22:25:17Z | |
| dc.date.issued | 2010-12-01 | |
| dc.description.abstract | Supervised Learning (SL) is a machine learning research area which aims at developing techniques able to take advantage from labeled training samples to make decisions over unseen examples. Recently, a lot of tools have been presented in order to perform machine learning in a more straightforward and transparent manner. However, one problem that is increasingly present in most of the SL problems being solved is that, sometimes, researchers do not completely understand what supervised learning is and, more often than not, publish results using machine learning black-boxes. In this paper, we shed light over the use of machine learning black-boxes and show researchers how far they can get using these out-of-the-box solutions instead of going deeper into the machinery of the classifiers. Here, we focus on one aspect of classifiers namely the way they compare examples in the feature space and show how a simple knowledge about the classifier's machinery can lift the results way beyond out-of-the-box machine learning solutions. © 2010 IEEE. | en |
| dc.description.affiliation | Institute of Computing Univ. of Campinas (UNICAMP), Campinas | |
| dc.description.affiliation | Department of Computer Science State Univ. of São Paulo (UNESP), Bauru | |
| dc.description.affiliation | Department of Science and Technology Federal Univ. of São Paulo (UNIFESP) São José Dos Campos | |
| dc.description.affiliationUnesp | Department of Computer Science State Univ. of São Paulo (UNESP), Bauru | |
| dc.format.extent | 193-200 | |
| dc.identifier | http://dx.doi.org/10.1109/SIBGRAPI.2010.34 | |
| dc.identifier.citation | Proceedings - 23rd SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2010, p. 193-200. | |
| dc.identifier.doi | 10.1109/SIBGRAPI.2010.34 | |
| dc.identifier.scopus | 2-s2.0-79952852833 | |
| dc.identifier.uri | http://hdl.handle.net/11449/226275 | |
| dc.language.iso | eng | |
| dc.relation.ispartof | Proceedings - 23rd SIBGRAPI Conference on Graphics, Patterns and Images, SIBGRAPI 2010 | |
| dc.source | Scopus | |
| dc.subject | K-Nearest neighbors | |
| dc.subject | Machine learning black-boxes | |
| dc.subject | Metrics space | |
| dc.subject | Neural networks | |
| dc.subject | Optimum-Path forest | |
| dc.subject | Pattern analysis | |
| dc.subject | Support vector machines | |
| dc.title | How far you can get using machine learning black-boxes | en |
| dc.type | Trabalho apresentado em evento | pt |
| dspace.entity.type | Publication | |
| relation.isDepartmentOfPublication | 872c0bbb-bf84-404e-9ca7-f87a0fe94e58 | |
| relation.isDepartmentOfPublication.latestForDiscovery | 872c0bbb-bf84-404e-9ca7-f87a0fe94e58 | |
| relation.isOrgUnitOfPublication | aef1f5df-a00f-45f4-b366-6926b097829b | |
| relation.isOrgUnitOfPublication.latestForDiscovery | aef1f5df-a00f-45f4-b366-6926b097829b | |
| unesp.campus | Universidade Estadual Paulista (UNESP), Faculdade de Ciências, Bauru | pt |
| unesp.department | Computação - FC | pt |
