Graph-Based Extractive Text Summarization Sentence Scoring Scheme for Big Data Applications
Information · 22.08.2023 · 14 (9) · 472
DOI: 10.3390/info14090472 ↗Kurz gefasst
Fachartikel in der Zeitschrift Information, online erschienen am 22.08.2023. Verfasst von Jai Prakash Verma und 7 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 98 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The recent advancements in big data and natural language processing (NLP) have necessitated proficient text mining (TM) schemes that can interpret and analyze voluminous textual data. Text summarization (TS) acts as an essential pillar within recommendation engines. Despite the prevalent use of abstractive techniques in TS, an anticipated shift towards a graph-based extractive TS (ETS) scheme is becoming apparent. The models, although simpler and less resource-intensive, are key in assessing reviews and feedback on products or services. Nonetheless, current methodologies have not fully resolved concerns surrounding complexity, adaptability, and computational demands. Thus, we propose our scheme, GETS, utilizing a graph-based model to forge connections among words and sentences through statistical procedures. The structure encompasses a post-processing stage that includes graph-based sentence clustering. Employing the Apache Spark framework, the scheme is designed for parallel execution, making it adaptable to real-world applications. For evaluation, we selected 500 documents from the WikiHow and Opinosis datasets, categorized them into five classes, and applied the recall-oriented understudying gisting evaluation (ROUGE) parameters for comparison with measures ROUGE-1, 2, and L. The results include recall scores of 0.3942, 0.0952, and 0.3436 for ROUGE-1, 2, and L, respectively (when using the clustered approach). Through a juxtaposition with existing models such as BERTEXT (with 3-gram, 4-gram) and MATCHSUM, our scheme has demonstrated notable improvements, substantiating its applicability and effectiveness in real-world scenarios.
Zitieren
APA
Verma, J. P., Bhargav, S., Bhavsar, M., Bhattacharya, P., Bostani, A., Chowdhury, S., Webber, J., & Mehbodniya, A. (2023). Graph-Based Extractive Text Summarization Sentence Scoring Scheme for Big Data Applications. Information, 14(9), 472. https://doi.org/10.3390/info14090472
Vancouver
Verma JP, Bhargav S, Bhavsar M, Bhattacharya P, Bostani A, Chowdhury S, et al. Graph-Based Extractive Text Summarization Sentence Scoring Scheme for Big Data Applications. Information. 2023;14(9):472. doi:10.3390/info14090472
BibTeX
@article{Verma2023,
author = {Verma, Jai Prakash and Bhargav, Shir and Bhavsar, Madhuri and Bhattacharya, Pronaya and Bostani, Ali and Chowdhury, Subrata and Webber, Julian and Mehbodniya, Abolfazl},
title = {Graph-Based Extractive Text Summarization Sentence Scoring Scheme for Big Data Applications},
journal = {Information},
year = {2023},
volume = {14},
number = {9},
pages = {472},
doi = {10.3390/info14090472}
}
EUVIMED