Automatic keyphrase extraction with a refined candidate set

13Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we develop and evaluate an automatic keyphrase extraction technique for scientific documents. A new candidate phrase generation method is proposed based on the core word expansion algorithm, which can reduce the size of candidate set by about 75% without increasing the computational complexity. Then in the step of feature calculation, when a phrase and its sub-phrases coexist as candidates, an inverse document frequency related feature is introduced for selecting the proper granularity. Experimental results show the efficiency and effectiveness of the refined candidate set and demonstrate that the overall performance of our system compares favorably with other known keyphrase extraction systems. © 2009 IEEE.

Cite

CITATION STYLE

APA

You, W., Fontaine, D., & Barthès, J. P. (2009). Automatic keyphrase extraction with a refined candidate set. In Proceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009 (Vol. 1, pp. 576–579). https://doi.org/10.1109/WI-IAT.2009.97

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free