Evidence map›Paper›PMID 36458230›Full record

ArticleComputational intelligence and neuroscience2022

N-GPETS: Neural Attention Graph-Based Pretrained Statistical Model for Extractive Text Summarization.

Muhammad Umair, Iftikhar Alam, Atif Khan, Inayat Khan, Niamat Ullah, Mohammad Yusuf Momand

RetractedAbstract readRetracted Publication
In one paragraph

Article in Computational intelligence and neuroscience, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. It has been retracted, and should not be counted. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

6 authors.

Muhammad UmairDepartment of Computer Science, City University of Science and Information Technology, Peshawar 25000, Pakistan.ORCID https://orcid.org/0000-0002-8759-2672
Iftikhar AlamDepartment of Computer Science, City University of Science and Information Technology, Peshawar 25000, Pakistan.
Atif KhanDepartment of Computer Science, Islamia College, Peshawar 25000, Pakistan.ORCID https://orcid.org/0000-0003-3628-0262
Inayat KhanDepartment of Computer Science, University of Engineering and Technology, Mardan, Pakistan.ORCID https://orcid.org/0000-0003-0895-9665
Niamat UllahDepartment of Computer Science, University of Buner, Buner 19290, Pakistan.
Mohammad Yusuf MomandFaculty of Computer Science, University of Nangarhar, Jalalabad 2600, Afghanistan.ORCID https://orcid.org/0000-0003-2069-6925

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The extractive summarization approach involves selecting the source document's salient sentences to build a summary. One of the most important aspects of extractive summarization is learning and modelling cross-sentence associations. Inspired by the popularity of Transformer-based Bidirectional Encoder Representations (BERT) pretrained linguistic model and graph attention network (GAT) having a sophisticated network that captures intersentence associations, this research work proposes a novel neural model N-GPETS by combining heterogeneous graph attention network with BERT model along with statistical approach using TF-IDF values for extractive summarization task. Apart from sentence nodes, N-GPETS also works with different semantic word nodes of varying granularity levels that serve as a link between sentences, improving intersentence interaction. Furthermore, proposed N-GPETS becomes more improved and feature-rich by integrating graph layer with BERT encoder at graph initialization step rather than employing other neural network encoders such as CNN or LSTM. To the best of our knowledge, this work is the first attempt to combine the BERT encoder and TF-IDF values of the entire document with a heterogeneous attention graph structure for the extractive summarization task. The empirical outcomes on benchmark news data sets CNN/DM show that the proposed model N-GPETS gets favorable results in comparison with other heterogeneous graph structures employing the BERT model and graph structures without the BERT model.

Indexed as

LearningModels, StatisticalLinguisticsNeural Networks, Computer

Identifiers

PMID36458230
PMCPMC9708337

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.