Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Main Core Retention on Graph-of-Words for Single-Document Keyword Extraction
verfasst von : François Rousseau, Michalis Vazirgiannis
Erschienen in: Advances in Information Retrieval
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we apply the concept of
k-core
on the
graph-of-words
representation of text for single-document keyword extraction, retaining only the nodes from the main core as representative terms. This approach takes better into account proximity between keywords and variability in the number of extracted keywords through the selection of more
cohesive
subsets of nodes than with existing graph-based approaches solely based on
centrality
. Experiments on two standard datasets show statistically significant improvements in F1-score and AUC of precision/recall curve compared to baseline results, in particular when weighting the edges of the graph with the number of co-occurrences. To the best of our knowledge, this is the first application of graph degeneracy to natural language processing and information retrieval.