2020
DOI: 10.1007/s12652-020-02591-x
|View full text |Cite
|
Sign up to set email alerts
|

A new graph-based extractive text summarization using keywords or topic modeling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 37 publications
(14 citation statements)
references
References 52 publications
0
14
0
Order By: Relevance
“…A keyword-based summary was then successfully created and sentiment analysis was created for the keywords. Another example of using a graph representation is in [13]. The authors assigned weight to the edges of the graph, on the basis of which the similarity in the graph was found.…”
Section: Related Workmentioning
confidence: 99%
“…A keyword-based summary was then successfully created and sentiment analysis was created for the keywords. Another example of using a graph representation is in [13]. The authors assigned weight to the edges of the graph, on the basis of which the similarity in the graph was found.…”
Section: Related Workmentioning
confidence: 99%
“…The findings of this study demonstrate that this approach, with a stronger emphasis on subtopics, outperforms conventional topic modeling and deep learning approaches in unsupervised extractive summarization. The graph-based summarization technique proposed in the study in [ 33 ] takes into account both the resemblance among individual statements and their relation to the entire document. This approach employs topic modeling to determine the pertinence of specific edges to the topics discussed in the text, as well as a semantic measure to evaluate the similarity between nodes.…”
Section: Related Workmentioning
confidence: 99%
“…El-Kassas et al [38] proposed EdgeSumm, combining many methods to leverage the strength and reduce the weakness. Belwal et al [39] again proposed a graph-based method, and this time author has added extra parameters to calculate the similarity between a node to the entire text.Survey and reviews done by Widyassari et.al [40],El-Kassas et al [41] and Yadav et al [42] were peculiar helpful to gather lot of useful data.…”
Section: Related Workmentioning
confidence: 99%