2015
DOI: 10.1002/asi.23365
|View full text |Cite
|
Sign up to set email alerts
|

SemGraph: Extracting keyphrases following a novel semantic graph‐based approach

Abstract: Keyphrases represent the main topics a text is about. In this article, we introduce SemGraph, an unsupervised algorithm for extracting keyphrases from a collection of texts based on a semantic relationship graph. The main novelty of this algorithm is its ability to identify semantic relationships between words whose presence is statistically significant. Our method constructs a co-occurrence graph in which words appearing in the same document are linked, provided their presence in the collection is statistical… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(21 citation statements)
references
References 17 publications
0
21
0
Order By: Relevance
“…Liu et al (2009) changed the weight of nodes in the graph with a topic-related degree of words by Latent Dirichlet Allocation topic algorithm. To improve the accuracy of weight assignment of the relationship between words, Martinez-Romo, Araujo, and Fernandez (2016) proposed a strategy in which the relationship between words is measured by the significant co-occurrence and the relationship in WordNet. To test the significant co-occurrence of two words, a null model-based statistical hypothesis test was employed.…”
Section: Related Workmentioning
confidence: 99%
“…Liu et al (2009) changed the weight of nodes in the graph with a topic-related degree of words by Latent Dirichlet Allocation topic algorithm. To improve the accuracy of weight assignment of the relationship between words, Martinez-Romo, Araujo, and Fernandez (2016) proposed a strategy in which the relationship between words is measured by the significant co-occurrence and the relationship in WordNet. To test the significant co-occurrence of two words, a null model-based statistical hypothesis test was employed.…”
Section: Related Workmentioning
confidence: 99%
“…Current research proposes several and diverse methods for automatic text summarization such as statistical [22], machine learning [23,24], text connectivity [25,26], conceptual graphs [27,28,29], algebraic reduction [30], clustering and probabilistic models [31,32,33] and methods adapted to the reader [34,35].…”
Section: Automatic Text Summarizationmentioning
confidence: 99%
“…Several popular graph-based systems have been proposed by researchers for example, TextRank [22], SingleRank [23], ExpandRank [24], SGRank [41]. Some other graph-based methods are recently introduced [42][43][44][45]. Most of the graph-based keyphrase extraction methods prefer single words as nodes that may result in missing multiword phrases [1], which is one of the drawbacks of graph-based methods.…”
Section: Related Workmentioning
confidence: 99%