dc.contributor | Universidade Federal de São Carlos (UFSCar) | |
dc.contributor | Universidade Estadual Paulista (Unesp) | |
dc.date.accessioned | 2018-11-26T17:54:16Z | |
dc.date.available | 2018-11-26T17:54:16Z | |
dc.date.created | 2018-11-26T17:54:16Z | |
dc.date.issued | 2018-01-01 | |
dc.identifier | Vipimage 2017. Cham: Springer International Publishing Ag, v. 27, p. 525-534, 2018. | |
dc.identifier | 2212-9391 | |
dc.identifier | http://hdl.handle.net/11449/164366 | |
dc.identifier | 10.1007/978-3-319-68195-5_57 | |
dc.identifier | WOS:000437032100057 | |
dc.description.abstract | NELL (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.language | eng | |
dc.publisher | Springer | |
dc.relation | Vipimage 2017 | |
dc.rights | Acesso aberto | |
dc.source | Web of Science | |
dc.subject | Never-ending language learning | |
dc.subject | Meta-heuristics | |
dc.subject | Descriptor combination | |
dc.title | Co-reference Analysis Through Descriptor Combination | |
dc.type | Actas de congresos | |