We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
-种基于 TextRank 的单文本关键字提取算法.
- Authors
柳林青; 余瀚; 费宁; 陈春玲
- Abstract
As a classical key-word extracting and abstraction auto-generating algorithm, Text Rank considered the text as a group of terms, and sought a latent semantic relationship between terms according to iteratively calculating the weights of the terms in the nodes graph. Based on the nodes graph model of TextRank, combined node graph and Markov state transform model, weighted the edge between nodes with conditional probability, proposed a new nodes graph model and corresponding algorithm TextRank_Revised(TR-R). According to the verification on labeled and unlabeled samples, it shows that without promotion of time complexity, the new algorithm can get a key-word sorting consequence which is closer to the manual than the original algorithm from the single text.
- Publication
Application Research of Computers / Jisuanji Yingyong Yanjiu, 2018, Vol 35, Issue 3, p705
- ISSN
1001-3695
- Publication type
Article
- DOI
10.3969/j.issn.1001-3695.2018.03.014