Logotipo do repositório
 

Publicação:
Co-reference Analysis Through Descriptor Combination

dc.contributor.authorMansano, A. F.
dc.contributor.authorHrushcka, E. R.
dc.contributor.authorPapa, J. P. [UNESP]
dc.contributor.authorTavares, JMRS
dc.contributor.authorJorge, RMN
dc.contributor.institutionUniversidade Federal de São Carlos (UFSCar)
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2018-11-26T17:54:16Z
dc.date.available2018-11-26T17:54:16Z
dc.date.issued2018-01-01
dc.description.abstractNELL (Never-Ending Language Learning) is the first never-ending learning system presented in the literature. It has been modeled to create a knowledge based on an autonomous way, reading the web 24 hours per day, 7 days per week. As such, the co-reference analysis has a crucial role in NELL's learning paradigm. In this paper, we approach a method to combining different feature vectors in order to solve the coreference resolution problem. In order to fulfill this work, an optimization task is devised by meta-heuristic techniques in order to maximize the separability of samples in the feature space, being the optimization process guided by the accuracy of Optimum Path Forest in a validation set. The experiments showed the proposed methodology can obtain much better results when compared to the performance of individual feature extraction algorithms.en
dc.description.affiliationUniv Fed Sao Carlos, Dept Comp, Sao Carlos, SP, Brazil
dc.description.affiliationSao Paulo State Univ, Dept Comp, Bauru, Brazil
dc.description.affiliationUnespSao Paulo State Univ, Dept Comp, Bauru, Brazil
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorshipCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.description.sponsorshipIdFAPESP: 2013/07375-0
dc.description.sponsorshipIdFAPESP: 2014/16250-9
dc.description.sponsorshipIdFAPESP: 2014/12236-1
dc.description.sponsorshipIdCNPq: 306166/2014-3
dc.description.sponsorshipIdCNPq: 470571/2013-6
dc.format.extent525-534
dc.identifierhttp://dx.doi.org/10.1007/978-3-319-68195-5_57
dc.identifier.citationVipimage 2017. Cham: Springer International Publishing Ag, v. 27, p. 525-534, 2018.
dc.identifier.doi10.1007/978-3-319-68195-5_57
dc.identifier.issn2212-9391
dc.identifier.urihttp://hdl.handle.net/11449/164366
dc.identifier.wosWOS:000437032100057
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofVipimage 2017
dc.rights.accessRightsAcesso aberto
dc.sourceWeb of Science
dc.subjectNever-ending language learning
dc.subjectMeta-heuristics
dc.subjectDescriptor combination
dc.titleCo-reference Analysis Through Descriptor Combinationen
dc.typeTrabalho apresentado em evento
dcterms.licensehttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dcterms.rightsHolderSpringer
dspace.entity.typePublication
unesp.campusUniversidade Estadual Paulista (UNESP), Faculdade de Ciências, Baurupt
unesp.departmentComputação - FCpt

Arquivos