Unsupervised Keyphrase Extraction with Multipartite Graphs
About
We propose an unsupervised keyphrase extraction model that encodes topical information within a multipartite graph structure. Our model represents keyphrase candidates and topics in a single graph and exploits their mutually reinforcing relationship to improve candidate ranking. We further introduce a novel mechanism to incorporate keyphrase selection preferences into the model. Experiments conducted on three widely used datasets show significant improvements over state-of-the-art graph-based models.
Florian Boudin• 2018
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Keyword Extraction | SemEval 2010 | F1 Score (k=10)25.4 | 31 | |
| Keyphrase Extraction | SemEval 2017 | F1@517.39 | 23 | |
| Keyphrase Generation | KP20k (test) | SemP36.4 | 23 | |
| Keyword Extraction | Inspec | F1 Score @ 1048 | 22 | |
| Keyword Extraction | SemEval 2017 | F1 Score @ 1043.9 | 22 | |
| Keyword Extraction | Fao30 | F1-score @ 100.15 | 22 | |
| Keyword Extraction | Thesis100 | F1 @ 1021.5 | 22 | |
| Keyword Extraction | WikiNews | F1-score @ 100.452 | 22 | |
| Keyword Extraction | pak18 | F1 Score @ 105 | 22 | |
| Keyphrase Generation | KPTimes (test) | Semantic Precision (SemP)41 | 21 |
Showing 10 of 24 rows