Autor(es): Afonso, Luis C. S. ; Colombo, Danilo ; Pereira, Clayton R. [UNESP] ; Costa, Kelton A. P. [UNESP] ; Papa, Joao P. [UNESP]
Data: 2020
Identificador Persistente: http://hdl.handle.net/11449/201222
Origem: Oasisbr
Autor(es): Afonso, Luis C. S. ; Colombo, Danilo ; Pereira, Clayton R. [UNESP] ; Costa, Kelton A. P. [UNESP] ; Papa, Joao P. [UNESP]
Data: 2020
Identificador Persistente: http://hdl.handle.net/11449/201222
Origem: Oasisbr
Made available in DSpace on 2020-12-12T02:27:09Z (GMT). No. of bitstreams: 0 Previous issue date: 2019-07-01
Multiple-instance (MI) learning aims at modeling problems that are better described by several instances of a given sample instead of individual descriptions often employed by standard machine learning approaches. In binary-driven MI problems, the entire bag is considered positive if one (at least) sample is labeled as positive. On the other hand, a bag is considered negative if it contains all samples labeled as negative as well. In this paper, we introduced the Optimum-Path Forest (OPF) classifier to the context of multiple-instance learning paradigm, and we evaluated it in different scenarios that range from molecule description, text categorization, and anomaly detection in well-drilling report classification. The experimental results showed that two different OPF classifiers are very much suitable to handle problems in the multiple-instance learning paradigm.
Department of Computing UFSCar - Federal University of São Carlos
Cenpes Petróleo Brasileiro S.A.
Department of Computing UNESP - São Paulo State University
Department of Computing UNESP - São Paulo State University