RaKUn: Rank-based Keyword extraction via Unsupervised learning and Meta vertex aggregation

Keyword extraction is used for summarizing the content of a document and supports efficient document retrieval, and is as such an indispensable part of modern text-based systems. We explore how load centrality, a graph-theoretic measure applied to graphs derived from a given text can be used to efficiently identify and rank keywords. Introducing meta vertices (aggregates of existing vertices) and systematic redundancy filters, the proposed method performs on par with state-of-the-art for the keyword extraction task on 14 diverse datasets. The proposed method is unsupervised, interpretable and can also be used for document visualization.Comment: The final authenticated publication is available online at https://doi.org/10.1007/978-3-030-31372-2_2

Comparing Machine Learning Algorithms to Predict Topic Keywords of Student Comments

Student comments as a kind of online teaching feedback in higher education organizations are becoming important which provides the evidence to improve the quality of teaching and learning. Effectively extracting useful information from the comments is critical. On the other hand, machine learning algorithms have achieved great performance in automatically extracting information and making predictions. This research compared the performance of three statistical machine learning algorithms and two deep learning methods on topic keyword extraction

Unsupervised keyword extraction using the GoW model and centrality scores

Comunicació presentada a: The 4th International Conference, INSCI 2017, celebrat a Thessaloniki, Grècia, del 22 al 24 de novembre de 2017.Nowadays, a large amount of text documents are produced on a daily basis, so we need e cient and e ective access to their con- tent. News articles, blogs and technical reports are often lengthy, so the reader needs a quick overview of the underlying content. To that end we present graph-based models for keyword extraction, in order to compare the Bag of Words model with the Graph of Words model in the key- word extraction problem. We compare their performance in two publicly available datasets using the evaluation measures Precision@10, mean Av- erage Precision and Jaccard coe cient. The methods we have selected for comparison are grouped into two main categories. On the one hand, centrality measures on the formulated Graph-of-Words (GoW) are able to rank all words in a document from the most central to the less central, according to their score in the GoW representation. On the other hand, community detection algorithms on the GoW provide the largest commu- nity that contains the key nodes (words) in the GoW. We selected these methods as the most prominent methods to identify central nodes in a GoW model. We conclude that term-frequency scores (BoW model) are useful only in the case of less structured text, while in more structured text documents, the order of words plays a key role and graph-based models are superior to the term-frequency scores per document.This work was supported by the projects H2020-645012 (KRISTINA) and H2020-700024 (TENSOR), funded by the European Commission