Recursive Sequence Mining to Discover Named Entity Relations - Archive ouverte HAL
Communication Dans Un Congrès Année : 2010

Recursive Sequence Mining to Discover Named Entity Relations

Peggy Cellier
Thierry Charnois
Marc Plantevit

Résumé

Extraction of named entity relations in textual data is an important challenge in natural language processing. For that purpose, we propose a new data mining approach based on recursive sequence mining. The contribution of this work is twofold. First, we present a method based on a cross-fertilization of sequence mining under constraints and recursive pattern mining to produce a user-manageable set of linguistic information extraction rules. Moreover, unlike most works from the state-of-the-art in natural language processing, our approach does not need syntactic parsing of the sentences neither resource except the training data. Second, we show in practice how to apply the computed rules to detect new relations between named entities, highlighting the interest of hybridization of data mining and natural language processing techniques in the discovery of knowledge. We illustrate our approach with the detection of gene interactions in biomedical literature.
Fichier principal
Vignette du fichier
ACTI-CELLIER-2010-2.pdf (5.77 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01016928 , version 1 (01-07-2014)

Identifiants

  • HAL Id : hal-01016928 , version 1

Citer

Peggy Cellier, Thierry Charnois, Marc Plantevit, Bruno Crémilleux. Recursive Sequence Mining to Discover Named Entity Relations. 9th International Symposium on Intelligent Data Analysis (IDA'10), May 2010, Tucson, Arizona, United States, United States. pp.30-41. ⟨hal-01016928⟩
268 Consultations
122 Téléchargements

Partager

More