MFSRank: an unsupervised method to extract keyphrases using semantic information
ADVANCES IN ARTIFICIAL INTELLIGENCE, PT I(2011)
摘要
This paper presents an unsupervised graph-based method to extract keyphrases using semantic information. The proposed method has two stages. In the first one, we have extracted MFS (Maximal Frequent Sequences) and built the nodes of a graph with them. The weight of the connection between two nodes has been established according to common statistical information and semantic relatedness. In the second stage, we have ranked MFS with traditionally PageRank algorithm; but we have included ConceptNet. This external resource adds an extra weight value between two MFS. The experimental results are competitive with traditional approaches developed in this area. MFSRank overcomes the baseline for top 5 keyphrases in precision, recall and F-score measures.
更多查看译文
关键词
common statistical information,maximal frequent sequences,unsupervised graph-based method,unsupervised method,extra weight value,semantic relatedness,semantic information,pagerank algorithm,f-score measure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要