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

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

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) and Yonghua Wen (Kunming University of Science and Technology, China)
Copyright: © 2020 |Pages: 12
DOI: 10.4018/IJISSS.2020040106

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.
Article Preview
Top

1. Introduction

There are millions of academic documents in the current academic network. How to discover knowledge from the literature is a challenging problem. Keywords as a concise summary of the literature have been widely used in Natural Language Processing and information retrieval tasks. Such as scientific and technical literature summarization (Sarkar, Nasipuri, & Ghose, 2010), text clustering (Hammouda, Matute, & Kamel, 2005) recommendation (Pudota, Dattolo, Baruzzo, Ferrara, & Tasso, 2010), query(Jones & Staveley, 1999). The extraction methods of key words are mainly divided into two kinds: supervised learning and unsupervised learning (Hasan & Ng, 2010, 2011; Merrouni, Frikh, & Ouhbi, 2017). In the literature review, Hasan (Hasan & Ng, 2011) summarized the supervised and unsupervised learning methods in the extraction of keyword extraction.

In supervised learning, the core idea is to convert the task of extracting key words into a two-classification problem. Using positive and negative examples of artificial annotation as training corpus, we train models by acquiring the various feature values and then classify the correct keywords from the literature. i.e. decision tree algorithm (C4.5) (Turney, 2002), Bayesian method (Frank, Paynter, Witten, Gutwin, & Nevill-Manning, 1999), neural network(Sarkar et al., 2010), SVM (Jiang, Hu, & Li, 2009), maximum entropy (Yih, Goodman, & Carvalho, 2006). These algorithms use all kinds of features in the text and integrate the features into the classification model for solving. In early studies, Frank built a system called KEA (Frank et al., 1999). The two features: TF-IDF and phrase first appear in the relative position of the document are incorporated into naive Bayes formula to predict. The prediction quality of the system depends on whether the training set can match the document which need to handle. KEA make the researcher realize that word frequency information and position information is most important feature to judge the keyword. The GenEx (Turney, 2000) method developed by Turney extracts the three features TF-IDF, the position of the phrase which first appears in the document and the length of phrases, and integrates them into the decision tree generation algorithm based on heuristic rules, which improves the evaluation of F value. Nguyen (Nguyen & Kan, 2007) extends the KEA to integrate the phrase's position information in the different chapters of the article into the model. Medelyan (Medelyan, Frank, & Witten, 2009) extends KEA and integrates the information of Wikipedia access into the model. Chuang (Chuang, Manning, & Heer, 2012) presents a model incorporating statistical information and language information to identify descriptive keywords from text. Caragea (Caragea, Bulgarov, Godea, & Gollapalli, 2014) proposed a supervised method of merging citation information with traditional feature information in the paper to extract key words from the scientific literature. Compared with previous methods, this method has improved the quality of extraction. However, when important words do not appear in important positions, such as the beginning of a sentence, or are not quoted, the prediction effect of the model will be affected.

In the unsupervised learning, the core idea is to transform the keyword extraction task into a kind of sorting work based on probability statistics or based on graphs. Use the various types of features in the text or the associations between features for statistics or sorting.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 13: 4 Issues (2021): Forthcoming, Available for Pre-Order
Volume 12: 4 Issues (2020): 3 Released, 1 Forthcoming
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing