dc.contributorUniversidade Federal de São Carlos (UFSCar)
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2018-11-26T17:54:16Z
dc.date.available2018-11-26T17:54:16Z
dc.date.created2018-11-26T17:54:16Z
dc.date.issued2018-01-01
dc.identifierVipimage 2017. Cham: Springer International Publishing Ag, v. 27, p. 525-534, 2018.
dc.identifier2212-9391
dc.identifierhttp://hdl.handle.net/11449/164366
dc.identifier10.1007/978-3-319-68195-5_57
dc.identifierWOS:000437032100057
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.
dc.languageeng
dc.publisherSpringer
dc.relationVipimage 2017
dc.rightsAcesso aberto
dc.sourceWeb of Science
dc.subjectNever-ending language learning
dc.subjectMeta-heuristics
dc.subjectDescriptor combination
dc.titleCo-reference Analysis Through Descriptor Combination
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución