Multiple-Instance Learning through Optimum-Path Forest

dc.contributor.authorAfonso, Luis C. S.
dc.contributor.authorColombo, Danilo
dc.contributor.authorPereira, Clayton R. [UNESP]
dc.contributor.authorCosta, Kelton A. P. [UNESP]
dc.contributor.authorPapa, Joao P. [UNESP]
dc.contributor.authorIEEE
dc.contributor.institutionUniversidade Federal de São Carlos (UFSCar)
dc.contributor.institutionPetr Brasileiro SA
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2020-12-10T19:58:25Z
dc.date.available2020-12-10T19:58:25Z
dc.date.issued2019-01-01
dc.description.abstractMultiple-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.en
dc.description.affiliationUFSCar Fed Univ Selo Carlos, Dept Comp, Sao Carlos, Brazil
dc.description.affiliationPetr Brasileiro SA, Cenpes, Rio De Janeiro, RJ, Brazil
dc.description.affiliationUNESP Sao Paulo State Univ, Dept Comp, Bauru, SP, Brazil
dc.description.affiliationUnespUNESP Sao Paulo State Univ, Dept Comp, Bauru, SP, Brazil
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.description.sponsorshipPetrobras
dc.description.sponsorshipIdFAPESP: 2013/07375-0
dc.description.sponsorshipIdFAPESP: 2014/122361
dc.description.sponsorshipIdFAPESP: 2016/19403-6
dc.description.sponsorshipIdFAPESP: 2017/22905-6
dc.description.sponsorshipIdCNPq: 307066/2017-7
dc.description.sponsorshipIdCNPq: 427968/2018-6
dc.description.sponsorshipIdPetrobras: 2014/00545-0
dc.format.extent7
dc.identifier.citation2019 International Joint Conference On Neural Networks (ijcnn). New York: Ieee, 7 p., 2019.
dc.identifier.issn2161-4393
dc.identifier.urihttp://hdl.handle.net/11449/196859
dc.identifier.wosWOS:000530893806001
dc.language.isoeng
dc.publisherIeee
dc.relation.ispartof2019 International Joint Conference On Neural Networks (ijcnn)
dc.sourceWeb of Science
dc.titleMultiple-Instance Learning through Optimum-Path Foresten
dc.typeTrabalho apresentado em evento
dcterms.licensehttp://www.ieee.org/publications_standards/publications/rights/rights_policies.html
dcterms.rightsHolderIeee
unesp.campusUniversidade Estadual Paulista (Unesp), Faculdade de Ciências, Baurupt
unesp.departmentComputação - FCpt

Arquivos