A Comparison of Centrality Measures for Graph-Based Keyphrase Extraction - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A Comparison of Centrality Measures for Graph-Based Keyphrase Extraction

Résumé

In this paper, we present and compare various centrality measures for graph-based keyphrase extraction. Through experiments carried out on three standard datasets of different languages and domains, we show that simple degree centrality achieve results comparable to the widely used TextRank algorithm, and that closeness centrality obtains the best results on short documents.
Fichier principal
Vignette du fichier
centrality_measures.pdf (250.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00850187 , version 1 (05-08-2013)

Identifiants

  • HAL Id : hal-00850187 , version 1

Citer

Florian Boudin. A Comparison of Centrality Measures for Graph-Based Keyphrase Extraction. International Joint Conference on Natural Language Processing (IJCNLP), Oct 2013, Nagoya, Japan. pp.834-838. ⟨hal-00850187⟩
682 Consultations
1893 Téléchargements

Partager

Gmail Facebook X LinkedIn More