| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560503 |
| ISSN: | 1405-5546 |
| Autores: | Muñoz, David1 Pérez, Fernando1 Pinto, David2 |
| Instituciones: | 1Technological University Dublin, Department of Computing, Dublín. Irlanda 2Benemérita Universidad Autónoma de Puebla, Faculty of Computer Science, Puebla. México |
| Año: | 2020 |
| Periodo: | Abr-Jun |
| Volumen: | 24 |
| Número: | 2 |
| Paginación: | 553-563 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Resumen en inglés | The identification of indirect relationships between texts from different sources makes the task of text mining useful when the goal is to obtain the most valuable information from a set of texts. That is why in the field of information retrieval the correct recognition of named entities plays an important role when extracting valuable information in large amounts of text. Therefore, it is important to propose techniques that improve the NER classifiers in order to achieve the correct recognition of named entities. In this work, a graph structure for storage and enrichment of named entities is proposed. It makes use of synonyms and domain-specific ontologies in the area of computing. The performance of the proposed structure is measured and compared with other NER classifiers in the experiments carried out. |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos |
| Keyword: | NER, N-grams, Text representation, Graph-based representation, Named entity recognition, Data processing |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
