|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|4973642||1365496||2018||20 صفحه PDF||سفارش دهید||دانلود کنید|
- An error-feedback algorithm for graph-based keyword extraction methods is proposed.
- Backpropagation increases the quality of extracted keyphrases in short articles.
- Term-weighting measures can be utilized to calculate expected keyphrase scores.
- Method performs better than the baseline methods and term-weighting approaches.
In recent years, unsupervised, graph-based ranking algorithms have been successfully applied to keyphrase extraction tasks. These methods have the advantage of taking into account global information, such as text structure and relations between words, phrases, and sentences, rather than relying solely on local, vertex-specific information. Graph-based approaches for keyphrase extraction, however, have a particular drawback, which comes from their frequency-based analysis methods. The weakness is that many common, less relevant terms may get a higher ranking, particularly in short articles. The converse situation also occurs, where less common (and possibly more relevant) terms obtain lower rankings. We propose an unsupervised method-RankUp-that enhances graph-based keyphrase extraction approaches by applying an error-feedback mechanism similar to the concept of backpropagation. Experiments have been performed on almost 3,300 short texts from a variety of domains. Our experiments show that error-feedback propagation can boost the quality of keyphrases in graph-based keyphrase extraction techniques.
Journal: Computer Speech & Language - Volume 47, January 2018, Pages 112-131