IDEAS home Printed from https://ideas.repec.org/a/igg/jisss0/v12y2020i2p76-87.html
   My bibliography  Save this article

Mining Keywords from Short Text Based on LDA-Based Hierarchical Semantic Graph Model

Author

Listed:
  • Wei Chen

    (Kunming University of Science and Technology, China)

  • Zhengtao Yu

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, China)

  • Yantuan Xian

    (Kunming University of Science and Technology, China)

  • Zhenhan Wang

    (Kunming University of Science and Technology, China)

  • Yonghua Wen

    (Kunming University of Science and Technology, China)

Abstract

Extracting keywords from a text set is an important task. Most of the previous studies extract keywords from a single text. Using the key topics in the text collection, the association relationship between the topic and the topic in the cross-text, and the association relationship between the words and the words in the cross-text has not played an important role in the previous method of extracting keywords from the text collection. In order to improve the accuracy of extracting keywords from text collections, using the semantic relationship between topics and topics in texts and highlighting the semantic relationship between words and words under the key topics, this article proposes an unsupervised method for mining keywords from short text collections. In this method, a two level semantic association model is used to link the semantic relations between topics and the semantic relations between words, and extract the key words based on the combined action. First, the text is represented with LDA; the authors used word2vec to calculate the semantic association between topic and topic, and build a semantic relation graph between topics, that is the upper level graph, and use a graph ranking algorithm to calculate each topic score. In the lower layer, the semantic association between words and words is calculated by using the topic scores and the relationship between topics in the upper network allow a graph to be constructed. Using a graph sorting algorithm sorts the words in short text sets to determine the keywords. The experimental results show that the method is better for extracting keywords from the text set, especially in short articles. In the text, the important topics, the relationship between topics and the correlation between words can improve the accuracy of extracting keywords from the text set.

Suggested Citation

  • Wei Chen & Zhengtao Yu & Yantuan Xian & Zhenhan Wang & Yonghua Wen, 2020. "Mining Keywords from Short Text Based on LDA-Based Hierarchical Semantic Graph Model," International Journal of Information Systems in the Service Sector (IJISSS), IGI Global, vol. 12(2), pages 76-87, April.
  • Handle: RePEc:igg:jisss0:v:12:y:2020:i:2:p:76-87
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISSS.2020040106
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jisss0:v:12:y:2020:i:2:p:76-87. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.